home *** CD-ROM | disk | FTP | other *** search
/ EnigmA Amiga Run 1996 June / EnigmA AMIGA RUN 08 (1996)(G.R. Edizioni)(IT)[!][issue 1996-06][EARSAN CD VII].iso / earcd / c-lang / vbcc.lha / vbcc / machine.c < prev    next >
C/C++ Source or Header  |  1996-05-15  |  89KB  |  2,061 lines
  1. /*  $VER: vbcc (machine.c amiga68k) V0.3    */
  2.  
  3. /*  File, das maschinenabhaengige Daten und Routinen fuer Codeerzeugung */
  4. /*  fuer Motorola 680x0-CPUs enthaelt (z.Z. auf 020+881 ausgerichtet).  */
  5.  
  6. #include "vbc.h"
  7.  
  8. /*  ab hier public Data, die vorhanden sein MUSS    */
  9.  
  10. char *ename[]={"strange","sequence","move","set+","set-","set*","set/","set%",
  11.                "set&","set^","set|","set<<","set>>","?:","lor","land","or",
  12.                "eor","and","equal","unequal","lt","le","gt","ge","lsl",
  13.                "lsr","add","sub","mul","div","mod","negate",
  14.                "not","preinc","postinc","predec","postdec","neg",
  15.                "dref-pointer","address-of","cast","call","index",
  16.                "dref-struct-pointer","dref-struct","identifier","constant",
  17.                "string","member",
  18.                 "convert-char","convert-short","convert-int","convert-long",
  19.                 "convert-float","convert-double","convert-void","convert-pointer",
  20.                 "convert-uchar","convert-ushort","convert-uint","convert-ulong",
  21.                 "address-of-array","first-element-of-array","pmult",
  22.                 "allocreg","freereg","pconstant","test","label","beq","bne",
  23.                 "blt","bge","ble","bgt","bra","compare","push","pop",
  24.                 "address-of-struct","add-int-to-pointer","sub-int-from-pointer",
  25.                 "sub-pointer-from-pointer","push-reg","pop-reg","pop-args",
  26.                 "save-regs","restore-regs","identifier-label","dc","align",
  27.                 "colon","get-return","set-return","move-from-reg","move-to-reg"};
  28.  
  29.  
  30. /*  Codegenerator-Flags                                 */
  31. int g_flags[MAXGF]={VALFLAG,VALFLAG,0,0,0,0,0,0,0,0,0};
  32. char *g_flags_name[MAXGF]={"cpu","fpu","d2scratch","noa4","sc","sd","prof","const-in-data","use-framepointer","no-addressing-modes","no-delayed-popping"};
  33. union ppi g_flags_val[MAXGF];
  34.  
  35. /* Tabelle fuer alignment requirements, maschinenabhaengig */
  36. int align[]={1,1,2,2,2,2,2,2,2,2,2,2,2,2,2};
  37. int maxalign=2;
  38.  
  39. /*  Tabelle fuer die Groesse der einzelnen Typen    */
  40. int sizetab[]={0,1,2,4,4,4,8,0,4,0,0,0,4,0};
  41.  
  42. /*  Tabelle fuer minimale und maximale Werte der Integer-Typen  */
  43. zlong t_min[32];
  44. zulong t_max[32];
  45.  
  46. /*  Namen der Register              */
  47. char *regnames[MAXR+1]={"noreg","a0","a1","a2","a3","a4","a5","a6","a7",
  48.                                "d0","d1","d2","d3","d4","d5","d6","d7",
  49.                         "fp0","fp1","fp2","fp3","fp4","fp5","fp6","fp7"};
  50.  
  51. /*  Groessen der Register in Bytes  */
  52. int regsize[MAXR+1]={0,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,12,12,12,12,12,12,12,12};
  53.  
  54. /*  Anfangswerte fuer die Register  */
  55. int regsa[MAXR+1]={0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
  56.  
  57. /*  Werden Register von Funktionen evtl. zerstoert? */
  58. int regscratch[MAXR+1]={0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0};
  59.  
  60. /*  Speicher fuer die Register      */
  61. int regs[MAXR+1];
  62.  
  63. /*  Merker, ob Register benutzt wurden  */
  64. int regused[MAXR+1];
  65.  
  66. /*  Variablen, die in Register liegen   */
  67. struct Var *regsv[MAXR+1];
  68.  
  69. /*  Variablen, in die Register gespeichert werden   */
  70. struct Var *regsbuf[MAXR+1];
  71.  
  72. /*  Merker, in welcher Blocktiefe diese gespeichert wurden  */
  73. int regbnesting[MAXR+1];
  74.  
  75. extern int float_used;
  76.  
  77. /*  Ab hier private Data, speziell fuer einen Codegenerator */
  78.  
  79. char reglist[200];
  80.  
  81.  
  82. #define DATA 0
  83. #define BSS 1
  84. #define CODE 2
  85.  
  86. int reglabel,freglabel,section=-1;
  87. char *codename,*bssname,*dataname;
  88.  
  89. struct IC *do_refs(FILE *,struct IC *);
  90. void pr(FILE *,struct IC *);
  91. int get_reg(FILE *,int,struct IC *);
  92. long pof2(zulong);
  93. void function_top(FILE *,struct Var *,int);
  94. void function_bottom(FILE *f,struct Var *,int);
  95.  
  96. void saveregs(FILE *,struct IC *),restoreregsa(FILE *,struct IC *),restoreregsd(FILE *,struct IC *);
  97.  
  98. void assign(FILE *,struct IC *,struct obj *,struct obj *,int,int,int);
  99.  
  100. char x_s[]={'0','b','w','3','l'};
  101. char x_t[]={'?','b','w','l','l','s','d','v','l','a','s','u','e','f','?','?'};
  102.  
  103. char *quick[2]={"","q"};
  104. char *strshort[2]={"l","w"};
  105.  
  106. char *ubranch[]={"beq","bne","blo","bhs","bls","bhi"};
  107.  
  108. int pushedreg,stored_cc; /* pushedreg&2: aregsaved; 4: dreg; 8: freg */
  109.                          /* 16: durch RESTOREREGS gepushed           */
  110. int pushlabel,pushflag;
  111.  
  112. #define D16OFF 1024
  113.  
  114. int newobj=0;   /*  um zu erkennen, ob neue section erlaubt ist */
  115.  
  116. int init_cg(void)
  117. /*  Initialisiert evtl. maschinenspezifische Sachen, liefert 0, */
  118. /*  wenn etwas schiefgegangen ist                               */
  119. {
  120.     /*  default CPU ist 68000   */
  121.     if(!(g_flags[0]&USEDFLAG)) g_flags_val[0].l=68000;
  122.     /*  keine FPU per default   */
  123.     if(!(g_flags[1]&USEDFLAG)) g_flags_val[1].l=0;
  124.     if(g_flags_val[1].l<68000) {x_t[FLOAT]='l';}
  125.     /*  d2 als Scratchregister markeiren, wenn cclib benutzt wird   */
  126.     if(g_flags[2]&USEDFLAG) regscratch[11]=1;
  127.     /*  a4 als Scratchregister markeiren, wenn sclib benutzt wird   */
  128.     if(g_flags[3]&USEDFLAG) regsa[5]=1;
  129.     codename="\tsection\t\"CODE\",code\n";
  130.     /*  SmallData-Vorbereitungen    */
  131.     if(g_flags[5]&USEDFLAG){
  132.         regsa[5]=1;
  133.         bssname= "\tsection\t\"__MERGED\",bss\n";
  134.         dataname="\tsection\t\"__MERGED\",data\n";
  135.     }else{
  136.         bssname= "\tsection\t\"BSS\",bss\n";
  137.         dataname="\tsection\t\"DATA\",data\n";
  138.     }
  139.     /*  a5 zur Nutzung freigeben, wenn kein Framepointer benutzt wird   */
  140.     if(!(g_flags[8]&USEDFLAG)) regsa[6]=0;
  141.     if(DEBUG&1) printf("CPU=%ld FPU=%ld\n",g_flags_val[0].l,g_flags_val[1].l);
  142.     vlong=l2zl(0L);
  143.     t_min[UNSIGNED|CHAR]=t_min[UNSIGNED|SHORT]=t_min[UNSIGNED|INT]=t_min[UNSIGNED|LONG]=vlong;
  144.     vlong=l2zl((long)SCHAR_MIN); t_min[CHAR]=vlong;
  145.     vlong=l2zl((long)SHRT_MIN ); t_min[SHORT]=vlong;
  146.     vlong=l2zl((long)INT_MIN  ); t_min[INT]=vlong;
  147.     vlong=l2zl((long)LONG_MIN ); t_min[LONG]=vlong;
  148.     vulong=ul2zul((unsigned long)SCHAR_MAX); t_max[CHAR]=vulong;
  149.     vulong=ul2zul((unsigned long)SHRT_MAX ); t_max[SHORT]=vulong;
  150.     vulong=ul2zul((unsigned long)INT_MAX  ); t_max[INT]=vulong;
  151.     vulong=ul2zul((unsigned long)LONG_MAX ); t_max[LONG]=vulong;
  152.     vulong=ul2zul((unsigned long)UCHAR_MAX); t_max[UNSIGNED|CHAR]=vulong;
  153.     vulong=ul2zul((unsigned long)USHRT_MAX); t_max[UNSIGNED|SHORT]=vulong;
  154.     vulong=ul2zul((unsigned long)UINT_MAX ); t_max[UNSIGNED|INT]=vulong;
  155.     vulong=ul2zul((unsigned long)ULONG_MAX); t_max[UNSIGNED|LONG]=vulong;
  156.     return(1);
  157. }
  158.  
  159. int freturn(struct Typ *t)
  160. /*  Liefert Register zurueck, in dem Typ t von Funktionen zurueckgegeben    */
  161. /*  wird. Liefert Null, wenn Wert auf Stack zurueckgegeben wird.            */
  162. /*  Achtung! t kann pointer sein, aber trotzdem t->next==0!!                */
  163. /*  maschinenabhaengig                                                      */
  164. {
  165.     if((t->flags&15)==FLOAT)
  166.         {if(g_flags_val[1].l>=68000) return(17); else return(9);}
  167.     if((t->flags&15)==DOUBLE)
  168.         {if(g_flags_val[1].l>=68000) return(17); else return(0);}
  169.     if((t->flags&15)==STRUCT||(t->flags&15)==UNION) return(0);
  170.     if(szof(t)<=4) return(9); else return(0);
  171. }
  172.  
  173.  
  174. int regok(int r,int t,int mode)
  175. /*  Testet, ob Register r den Typ t verkraftet          */
  176. /*  mode!=0: mit Typ mode dereferenzierbar              */
  177. /*  natuerlich maschinenabhaengig                       */
  178. /*  Reg 1-8=a0-a7 9-16=d0-d7 und 17-24=FP0-FP7          */
  179. /*  dn nur Integers, an nur Pointer und FPn nur FK      */
  180. {
  181.     if(r==0) return(0);
  182.     t&=15;
  183.     if(t==FLOAT||t==DOUBLE){
  184.         if(g_flags_val[1].l>=68000){
  185.             if(r>=17&&r<=24) return(1); else return(0);
  186.         }else{
  187.             if(t==FLOAT&&r>=9&&r<=16) return(1); else return(0);
  188.         }
  189.     }
  190.     if(t==POINTER&&mode==0&&r>=9&&r<=16) return(1);
  191.     if(t==POINTER&&r>=1&&r<=8) return(1);
  192.     if(t>=CHAR&&t<=LONG&&r>=9&&r<=16) return(1);
  193.     return(0);
  194. }
  195.  
  196. int isquickkonst(union atyps *,int),isquickkonst2(union atyps *,int),regavailable(int);
  197. void move(FILE *,struct obj *,int,struct obj *,int,int);
  198. void add(FILE *,struct obj *,int,struct obj *,int,int);
  199. void sub(FILE *,struct obj *,int,struct obj *,int,int);
  200. void mult(FILE *,struct obj *,int,struct obj *,int,int,int,struct IC *);
  201.  
  202. long pof2(zulong x)
  203. /*  gibt log2(x)+1 oder 0 zurueck */
  204. {
  205.     zulong p;int ln=1;
  206.     p=ul2zul(1L);
  207.     while(zulleq(p,x)){
  208.         if(zuleqto(x,p)) return(ln);
  209.         ln++;p=zuladd(p,p);
  210.     }
  211.     return(0);
  212. }
  213.  
  214. #define isreg(x) ((p->x.flags&(REG|DREFOBJ))==REG)
  215.  
  216. #define PEA 1000
  217.  
  218. int addressing(void);
  219. long notpopped,stackoffset,loff;
  220. int offlabel,regoffset;
  221. /*  Merken, wofuer ConditionCodes gesetzt sind  */
  222. struct obj *cc_set,*cc_set_tst;
  223. int cc_typ,cc_typ_tst;
  224.  
  225.  
  226. void gen_code(FILE *f,struct IC *p,struct Var *v,int offset)
  227. /*  Eigentliche gen_code()-Routine                          */
  228. {
  229.     int c,t,comptyp;char fp[2]="\0\0";
  230.     if(DEBUG&1) printf("gen_code()\n");
  231.     for(c=1;c<=MAXR;c++) regs[c]=regsa[c];
  232.     if(!(g_flags[9]&USEDFLAG)){
  233.     /*  Adressierungsarten benutzen */
  234.         if(!addressing()) offset=0;
  235.     }
  236.     reglabel=++label;freglabel=++label;
  237.     function_top(f,v,offset);
  238.     if(p!=first_ic) ierror(0);
  239.     cc_set=cc_set_tst=0;
  240.     stackoffset=notpopped=0;
  241.     for(;p;pr(f,p),p=p->next){
  242.         c=p->code;t=p->typf;
  243.         cc_set_tst=cc_set;
  244.         cc_typ_tst=cc_typ;
  245.         if(cc_set_tst&&(DEBUG&512)){fprintf(f,"; cc_set_tst=");probj(f,cc_set_tst,t,0);fprintf(f,"\n");}
  246.         if(cc_set&&(DEBUG&512)){fprintf(f,"; cc_set=");probj(f,cc_set,t,0);fprintf(f,"\n");}
  247.         pushedreg&=16;if(c==RESTOREREGS) pushedreg=0;
  248.         if(DEBUG&256){fprintf(f,"; "); pric2(f,p);}
  249.         if(DEBUG&512) fprintf(f,"; stackoffset=%ld, notpopped=%ld, pushedreg=%d\n",stackoffset,notpopped,pushedreg);
  250.         /*  muessen wir Argumente poppen?   */
  251.         if(notpopped){
  252.             int flag=0;
  253.             if(c==LABEL||c==COMPARE||c==TEST||c==BRA) flag=1;
  254.             /*  wenn demnaechst TEST kommt, gleich poppen, um evtl. ein */
  255.             /*  tst einzusparen                                         */
  256.             if(!flag&&c!=CALL&&c!=GETRETURN){
  257.                 struct IC *np=p->next;
  258.                 while(np&&np->code==FREEREG) np=np->next;
  259.                 if(np&&np->code==TEST) flag=1;
  260.             }
  261.             if(flag){
  262.                 fprintf(f,"\tadd%s.%s\t#%ld,a7\n",quick[notpopped<=8],strshort[notpopped<32768],notpopped);
  263.                 stackoffset+=notpopped;notpopped=0;/*cc_set_tst=cc_set=0;*/
  264.             }
  265.         }
  266.         /*  na, ob das hier ok ist..?   */
  267.         if(c==SUBPFP) c=SUB;
  268.         if(c==PMULT) c=MULT;
  269.         if(c==ALLOCREG) {regs[p->q1.reg]=1;continue;}
  270.         if(c==FREEREG) {regs[p->q1.reg]=0;continue;}
  271.         if(c==LABEL) {fprintf(f,"l%d\n",t);cc_set=0;continue;}
  272.         if(c==BRA){fprintf(f,"\tbra\tl%d\n",t);continue;}
  273.         if(c>=BEQ&&c<BRA){
  274.             if(stored_cc){fprintf(f,"\tbne\tl%d\n",t);stored_cc=0;continue;}
  275.             if((comptyp&UNSIGNED)||(comptyp&15)==POINTER){
  276.                 fprintf(f,"\t%s\tl%d\n",ubranch[c-BEQ],t);
  277.             }else{
  278.                 fprintf(f,"\t%s%s\tl%d\n",fp,ename[c],t);
  279.             }
  280.             continue;
  281.         }
  282.         if(p->q1.am){
  283.             if(!regs[p->q1.am->basereg]){pric2(stdout,p);printf("%s\n",regnames[p->q1.am->basereg]); ierror(0);}
  284.             if(p->q1.am->dreg&&!regs[p->q1.am->dreg&127]) {printf("Register %s:\n",regnames[p->q1.am->dreg&127]);ierror(0);}
  285.         }
  286.         if(p->q2.am){
  287.             if(!regs[p->q2.am->basereg]) ierror(0);
  288.             if(p->q2.am->dreg&&!regs[p->q2.am->dreg&127]) {printf("Register %s:\n",regnames[p->q2.am->dreg&127]);ierror(0);}
  289.         }
  290.         if(p->z.am){
  291.             if(!regs[p->z.am->basereg]) ierror(0);
  292.             if(p->z.am->dreg&&!regs[p->z.am->dreg&127]) {printf("Register %s:\n",regnames[p->z.am->dreg&127]);ierror(0);}
  293.         }
  294.         if((p->q1.flags®)&&!regs[p->q1.reg]){printf("Register %s:\n",regnames[p->q1.reg]);ierror(0);}
  295.         if((p->q2.flags®)&&!regs[p->q2.reg]){printf("Register %s:\n",regnames[p->q2.reg]);ierror(0);}
  296.         if((p->z.flags®)&&!regs[p->z.reg]){printf("Register %s:\n",regnames[p->z.reg]);ierror(0);}
  297.         if((p->q2.flags®)&&(p->z.flags®)&&p->q2.reg==p->z.reg){pric2(stdout,p);ierror(0);}
  298.         if((p->q2.flags&VAR)&&(p->z.flags&VAR)&&p->q2.v==p->z.v){pric2(stdout,p);ierror(0);}
  299.         /*  COMPARE #0 durch TEST ersetzen (erlaubt, da tst alle Flags setzt)   */
  300.         if(c==COMPARE&&(p->q2.flags&KONST)){
  301.             eval_const(&p->q2.val,t);
  302.             if(zleq(vlong)&&zuleq(vulong)&&zdeq(vdouble)){
  303.                 c=p->code=TEST;p->q2.flags=0;
  304.             }
  305.         }
  306.         if(c==COMPARE&&(p->q1.flags&KONST)){
  307.             eval_const(&p->q1.val,t);
  308.             if(zleq(vlong)&&zuleq(vulong)&&zdeq(vdouble)){
  309.                 struct IC *bp=p->next;int bc;
  310.                 c=p->code=TEST;p->q1=p->q2;p->q2.flags=0;p->q2.am=0;
  311.                 /*  Nachfolgenden Branch umdrehen   */
  312.                 while(bp&&bp->code==FREEREG) bp=bp->next;
  313.                 bc=bp->code;
  314.                 if(!bp||bc<BEQ||bc>BGT) ierror(0);
  315.                 if(bc==BLT) bp->code=BGT;
  316.                 if(bc==BGT) bp->code=BLT;
  317.                 if(bc==BLE) bp->code=BGE;
  318.                 if(bc==BGE) bp->code=BLE;
  319.             }
  320.         }
  321.         /*  gesetzte ConditionCodes merken  */
  322.         if(p->z.flags&&(!isreg(z)||p->z.reg>=9)&&c!=CONVFLOAT&&c!=CONVDOUBLE&&(((t&15)!=FLOAT&&(t&15)!=DOUBLE)||g_flags_val[1].l>68000)){
  323.              cc_set=&p->z;cc_typ=p->typf;
  324.         }else{
  325.             cc_set=0;
  326.         }
  327.         if(c==PEA){
  328.             fprintf(f,"\tpea\t");probj(f,&p->q1,t,0);fprintf(f,"\n");
  329.             stackoffset-=p->q2.reg;
  330.             continue;
  331.         }
  332.         if(c==PUSHREG){
  333.             if(p->q1.reg<17) {fprintf(f,"\tmove.l\t%s,-(a7)\n",regnames[p->q1.reg]);stackoffset-=4;}
  334.              else {fprintf(f,"\tfmove.x\t%s,-(a7)\n",regnames[p->q1.reg]);stackoffset-=12;}
  335.             continue;
  336.         }
  337.         if(c==MOVEFROMREG){
  338.             if(p->q1.reg<17) fprintf(f,"\tmove.l\t%s,",regnames[p->q1.reg]);
  339.                 else         fprintf(f,"\tfmove.x\t%s,",regnames[p->q1.reg]);
  340.             probj(f,&p->z,t,0);fprintf(f,"\n");
  341.             continue;
  342.         }
  343.         if(c==MOVETOREG){
  344.             if(p->z.reg<17) fprintf(f,"\tmove.l\t");
  345.                 else        fprintf(f,"\tfmove.x\t");
  346.             probj(f,&p->q1,t,0);fprintf(f,",%s\n",regnames[p->z.reg]);
  347.             continue;
  348.         }
  349.         if(c==POPREG){
  350.             if(p->z.reg<17) {fprintf(f,"\tmove.l\t(a7)+,%s\n",regnames[p->z.reg]);stackoffset+=4;}
  351.              else {fprintf(f,"\tfmove.x\t(a7)+,%s\n",regnames[p->z.reg]);stackoffset+=12;}
  352.             continue;
  353.         }
  354.         if(c==SAVEREGS||c==RESTOREREGS){
  355.             ierror(0);
  356.             continue;
  357.         }
  358.         if(g_flags[9]&USEDFLAG)
  359.             if(p->q1.am||p->q2.am||p->z.am){
  360.                 ierror(0);
  361.                 p->q1.am=p->q2.am=p->z.am=0;
  362.             }
  363.         p=do_refs(f,p);
  364.         if(g_flags[9]&USEDFLAG)
  365.             if(p->q1.am||p->q2.am||p->z.am){
  366.                 ierror(0);
  367.                 p->q1.am=p->q2.am=p->z.am=0;
  368.             }
  369.         if(c>=CONVCHAR&&c<=CONVULONG){
  370.             int to;
  371.             if(c==CONVCHAR) to=CHAR;
  372.             if(c==CONVUCHAR) to=UNSIGNED|CHAR;
  373.             if(c==CONVSHORT) to=SHORT;
  374.             if(c==CONVUSHORT) to=UNSIGNED|SHORT;
  375.             if(c==CONVINT) to=LONG;
  376.             if(c==CONVUINT) to=UNSIGNED|LONG;
  377.             if(c==CONVLONG) to=LONG;
  378.             if(c==CONVULONG) to=UNSIGNED|LONG;
  379.             if(c==CONVFLOAT) to=FLOAT;
  380.             if(c==CONVDOUBLE) to=DOUBLE;
  381.             if(c==CONVPOINTER) to=UNSIGNED|LONG;
  382.             if(c==CONVVOID){ierror(0);continue;}
  383.             if(t==FLOAT||t==DOUBLE||to==FLOAT||to==DOUBLE){
  384.                 if(g_flags_val[1].l>=68000){
  385.                     int zreg=0;
  386.                     if((t==FLOAT||t==DOUBLE)&&(to==FLOAT||to==DOUBLE)){
  387.                         if(isreg(q1)&&isreg(z)){
  388.                             if(p->q1.reg!=p->z.reg)
  389.                                 fprintf(f,"\tfmove.x\t%s,%s\n",regnames[p->q1.reg],regnames[p->z.reg]);
  390.                             continue;
  391.                         }
  392.                     }
  393.                     if(isreg(z)&&p->z.reg>=17)
  394.                         zreg=p->z.reg;
  395.                     if(isreg(q1)&&p->q1.reg>=17){
  396.                         if(!zreg) zreg=p->q1.reg; else zreg=get_reg(f,2,p);}
  397.                     if(!zreg) zreg=get_reg(f,2,p);
  398.                     if((to&UNSIGNED)&&x_t[to&15]!='l'){
  399.                         int dreg=get_reg(f,1,p);
  400.                         fprintf(f,"\tmoveq\t#0,%s\n",regnames[dreg]);
  401.                         move(f,&p->q1,0,0,dreg,to);
  402.                         move(f,0,dreg,0,zreg,LONG);
  403.                     }else{
  404.                         if(!isreg(q1)||p->q1.reg!=zreg)
  405.                             move(f,&p->q1,0,0,zreg,to);
  406.                     }
  407.                     if(t!=FLOAT&&t!=DOUBLE){
  408.                     /*  nach integer, d.h. Kommastellen abschneiden */
  409.                         if(g_flags_val[1].l==68040/*||g_flags_val[1].l==68060*/){
  410.                         /*  bei 040 emuliert    */
  411.                             int dreg1=get_reg(f,1,p),dreg2=get_reg(f,1,p);
  412.                             fprintf(f,"\tfmove.l\tfpcr,%s\n",regnames[dreg2]);
  413.                             fprintf(f,"\tmoveq\t#16,%s\n",regnames[dreg1]);
  414.                             fprintf(f,"\tor.l\t%s,%s\n",regnames[dreg2],regnames[dreg1]);
  415.                             fprintf(f,"\tand.w\t#-33,%s\n",regnames[dreg1]);
  416.                             fprintf(f,"\tfmove.l\t%s,fpcr\n",regnames[dreg1]);
  417.                             fprintf(f,"\tfmove.%c\t%s,",x_t[t&15],regnames[zreg]);
  418.                             probj(f,&p->z,t,0);fprintf(f,"\n");
  419.                             fprintf(f,"\tfmove.l\t%s,fpcr\n",regnames[dreg2]);
  420.                             continue;
  421.                         }else{
  422.                             if(!isreg(q1)||p->q1.reg!=zreg){
  423.                                 fprintf(f,"\tfintrz\t%s\n",regnames[zreg]);
  424.                             }else{
  425.                                 int nreg=get_reg(f,2,p);
  426.                                 fprintf(f,"\tfintrz\t%s,%s\n",regnames[zreg],regnames[nreg]);
  427.                                 zreg=nreg;
  428.                             }
  429.                         }
  430.                     }
  431.                     if(to&UNSIGNED&&x_t[to&15]=='l'){
  432.                         int nlabel;
  433.                         fprintf(f,"\ttst.%c\t",x_t[to&15]);
  434.                         probj(f,&p->q1,to,0);fprintf(f,"\n");
  435.                         nlabel=++label;
  436.                         fprintf(f,"\tbge\tl%d\n",nlabel);
  437.                         fprintf(f,"\tfadd.d\t#4294967296,%s\n",regnames[zreg]);
  438.                         fprintf(f,"l%d\n",nlabel);
  439.                     }
  440.                     if(!(p->z.reg)||p->z.reg!=zreg){
  441.                         move(f,0,zreg,&p->z,0,t);
  442.                     }
  443.                 }else{
  444.                     cc_set=0;
  445.                     if(to==t){
  446.                         assign(f,p,&p->q1,&p->z,ASSIGN,p->q2.reg,t);
  447.                         continue;
  448.                     }
  449.                     if(to==FLOAT&&t==DOUBLE){
  450.                         saveregs(f,p);
  451.                         assign(f,p,&p->q1,0,PUSH,sizetab[FLOAT],FLOAT);
  452.                         fprintf(f,"\tpublic\t__ieees2d\n\tjsr\t__ieees2d\n\taddq.w\t#4,a7\n");
  453.                         stackoffset+=4;
  454.                         restoreregsa(f,p);
  455.                         fprintf(f,"\tmovem.l\td0/d1,");
  456.                         probj(f,&p->z,t,0);fprintf(f,"\n");
  457.                         restoreregsd(f,p);
  458.                         continue;
  459.                     }
  460.                     if(to==DOUBLE&&t==FLOAT){
  461.                         saveregs(f,p);
  462.                         assign(f,p,&p->q1,0,PUSH,sizetab[DOUBLE],DOUBLE);
  463.                         fprintf(f,"\tpublic\t__ieeed2s\n\tjsr\t__ieeed2s\n\taddq.w\t#8,a7\n");
  464.                         stackoffset+=8;
  465.                         restoreregsa(f,p);
  466.                         move(f,0,9,&p->z,0,t);
  467.                         restoreregsd(f,p);
  468.                         continue;
  469.                     }
  470.                     if(to==FLOAT||to==DOUBLE){
  471.                         int uns;
  472.                         saveregs(f,p);
  473.                         if(t&UNSIGNED) uns='u'; else uns='s';
  474.                         assign(f,p,&p->q1,0,PUSH,sizetab[to&15],to);
  475.                         fprintf(f,"\tpublic\t__ieeefix%c%c\n\tjsr\t__ieeefix%c%c\n\taddq.w\t#%d,a7\n",x_t[to&15],uns,x_t[to&15],uns,sizetab[to&15]);
  476.                         stackoffset+=sizetab[to&15];
  477.                         restoreregsa(f,p);
  478.                         move(f,0,9,&p->z,0,t);
  479.                         restoreregsd(f,p);
  480.                         continue;
  481.                     }else{
  482.                         int uns,xt=x_t[to&15];
  483.                         saveregs(f,p);
  484.                         if(to&UNSIGNED) uns='u'; else uns='s';
  485.                         if(xt!='l') {fprintf(f,"\tsubq.w\t#4,a7\n");stackoffset-=4;}
  486.                         fprintf(f,"\tmove.%c\t",xt);
  487.                         probj(f,&p->q1,to,0);
  488.                         if(xt!='l') fprintf(f,",(a7)\n"); else {fprintf(f,",-(a7)\n");stackoffset-=4;}
  489.                         fprintf(f,"\tpublic\t__ieeeflt%c%c%c\n\tjsr\t__ieeeflt%c%c%c\n\taddq.w\t#4,a7\n",uns,xt,x_t[t&15],uns,xt,x_t[t&15]);
  490.                         stackoffset+=4;
  491.                         restoreregsa(f,p);
  492.                         if(t==DOUBLE){
  493.                             fprintf(f,"\tmovem.l\td0/d1,");
  494.                             probj(f,&p->z,t,0);fprintf(f,"\n");
  495.                         }else move(f,0,9,&p->z,0,t);
  496.                         restoreregsd(f,p);
  497.                         continue;
  498.                     }
  499.                 }
  500.                 continue;
  501.             }
  502.             if((to&15)<(t&15)){
  503.                 int zreg;
  504.                 if(isreg(z)&&p->z.reg>=9&&p->z.reg<=16)
  505.                     zreg=p->z.reg; else zreg=get_reg(f,1,p);
  506.                 /*  aufpassen, falls unsigned und Quelle==Ziel  */
  507.                 if((to&UNSIGNED)&&isreg(q1)&&zreg==p->q1.reg){
  508.                     unsigned long l;
  509.                     if((to&15)==CHAR) l=0xff; else l=0xffff;
  510.                     fprintf(f,"\tand.%c\t#%lu,%s\n",x_t[t&15],l,regnames[zreg]);
  511.                     continue;
  512.                 }
  513.                 if(to&UNSIGNED) fprintf(f,"\tmoveq\t#0,%s\n",regnames[zreg]);
  514.                 move(f,&p->q1,0,0,zreg,to);
  515.                 if(!(to&UNSIGNED)){
  516.                     if((to&15)==CHAR&&(t&15)==SHORT) fprintf(f,"\text.w\t%s\n",regnames[zreg]);
  517.                     if((to&15)==SHORT&&sizetab[t&15]==4) fprintf(f,"\text.l\t%s\n",regnames[zreg]);
  518.                     if((to&15)==CHAR&&sizetab[t&15]==4){
  519.                         if(g_flags_val[0].l>=68020)
  520.                             fprintf(f,"\textb.l\t%s\n",regnames[zreg]);
  521.                         else
  522.                             fprintf(f,"\text.w\t%s\n\text.l\t%s\n",regnames[zreg],regnames[zreg]);
  523.                     }
  524.                 }
  525.                 if(!isreg(z)||p->z.reg!=zreg){
  526.                     move(f,0,zreg,&p->z,0,t);
  527.                 }
  528.             }else{
  529.                 long diff;int m;
  530.                 m=0;
  531.                 if(p->q1.flags®){
  532.                     p->q1.val.vlong=l2zl(0L);
  533.                     p->q1.flags|=D16OFF;m=1;
  534.                 }
  535.                 diff=sizetab[to&15]-sizetab[t&15];
  536.                 vlong=l2zl(diff);
  537.                 p->q1.val.vlong=zladd(p->q1.val.vlong,vlong);
  538.                 move(f,&p->q1,0,&p->z,0,t);
  539.                 vlong=l2zl(diff);
  540.                 p->q1.val.vlong=zlsub(p->q1.val.vlong,vlong);
  541.                 if(m) p->q1.flags&=~D16OFF;
  542.             }
  543.             continue;
  544.         }
  545.         if((t==FLOAT||t==DOUBLE)&&g_flags_val[1].l>=68000) *fp='f'; else *fp=0;
  546.         if(c==MINUS||c==KOMPLEMENT){
  547.             int zreg;
  548.             if(t==FLOAT||t==DOUBLE){
  549.                 if(g_flags_val[1].l>=68000){
  550.                     if(isreg(z)) zreg=p->z.reg; else zreg=get_reg(f,2,p);
  551.                     fprintf(f,"\tfneg.%c\t",x_t[t&15]);probj(f,&p->q1,t,0);
  552.                     fprintf(f,",%s\n",regnames[zreg]);
  553.                     if(!isreg(z)||p->z.reg!=zreg){
  554.                         move(f,0,zreg,&p->z,0,t);
  555.                     }
  556.                     continue;
  557.                 }else{
  558.                     saveregs(f,p);
  559.                     assign(f,p,&p->q1,0,PUSH,sizetab[t&15],t);
  560.                     fprintf(f,"\tpublic\t__ieeeneg%c\n\tjsr\t__ieeeneg%c\n\taddq.w\t#%d,a7\n",x_t[t&15],x_t[t&15],sizetab[t&15]);
  561.                     stackoffset+=sizetab[t&15];
  562.                     restoreregsa(f,p);
  563.                     if(t==DOUBLE){
  564.                         fprintf(f,"\tmovem.l\td0/d1,");
  565.                         probj(f,&p->z,t,0);fprintf(f,"\n");
  566.                     }else move(f,0,9,&p->z,0,t);
  567.                     restoreregsd(f,p);
  568.                     continue;
  569.                 }
  570.             }
  571.             if(compare_objects(&p->q1,&p->z)){
  572.                 fprintf(f,"\t%s.%c\t",ename[c],x_t[t&15]);
  573.                 probj(f,&p->q1,t,0);fprintf(f,"\n");
  574.                 continue;
  575.             }
  576.             if(isreg(z)&&p->z.reg>=9/*&&p->z.reg<=16*/)
  577.                 zreg=p->z.reg; else zreg=get_reg(f,1,p);
  578.             if(!isreg(q1)||p->q1.reg!=zreg){
  579.                 move(f,&p->q1,0,0,zreg,t);
  580.             }
  581.             fprintf(f,"\t%s.%c\t%s\n",ename[c],x_t[t&15],regnames[zreg]);
  582.             if(!isreg(z)||p->z.reg!=zreg){
  583.                 move(f,0,zreg,&p->z,0,t);
  584.             }
  585.             continue;
  586.         }
  587.         if(c==SETRETURN){
  588.         /*  Returnwert setzen - q2.reg==size, z.reg==Returnregister */
  589.         /*  Wenn Returnwert ueber Zeiger gesetzt wird, nichts noetig    */
  590.             if(p->z.reg) move(f,&p->q1,0,0,p->z.reg,p->typf);
  591.             continue;
  592.         }
  593.         if(c==GETRETURN){
  594.         /*  Returnwert holen - q2.reg==size, q1.reg==Returnregister     */
  595.         /*  Wenn Returnwert ueber Zeiger gesetzt wird, nichts noetig    */
  596.             cc_set=0;
  597.             if(p->q1.reg){
  598.                 move(f,0,p->q1.reg,&p->z,0,p->typf);
  599.                 if(!(p->z.flags®)||(p->z.reg!=p->q1.reg&&p->z.reg>=9)){ cc_set=&p->z;cc_typ=p->typf;}
  600.             }
  601.             continue;
  602.         }
  603.         if(c==CALL){
  604.             fprintf(f,"\tjsr\t");probj(f,&p->q1,t,0);
  605.             fprintf(f,"\n");
  606.             if(p->q2.reg){
  607.                 notpopped+=p->q2.reg;
  608.                 if(!(g_flags[10]&USEDFLAG)&&!(pushedreg&30)&&stackoffset==-notpopped){
  609.                 /*  Entfernen der Parameter verzoegern  */
  610.                 }else{
  611.                     fprintf(f,"\tadd%s.%s\t#%d,a7\n",quick[p->q2.reg<=8],strshort[p->q2.reg<32768],p->q2.reg);
  612.                     stackoffset+=p->q2.reg;
  613.                     notpopped-=p->q2.reg;
  614.                 }
  615.             }
  616.             continue;
  617.         }
  618.         if(c==TEST){
  619.             /*  ConditionCodes schon gesetzt?   */
  620.             cc_set=&p->q1;cc_typ=t;
  621.             comptyp=t;
  622.             if(cc_set_tst&&t==cc_typ_tst){
  623.                 struct IC *branch;int fl;
  624.                 if(t&UNSIGNED){
  625.                     branch=p->next;
  626.                     while(branch&&(branch->code<BEQ||branch->code>BGT))
  627.                         branch=branch->next;
  628.                     if(!branch) ierror(0);
  629.                     if(branch->code==BNE||branch->code==BEQ) fl=0; else fl=1;
  630.                 }else fl=0;
  631.                 if(!fl){
  632.                     if(compare_objects(&p->q1,cc_set_tst)&&p->q1.am==cc_set_tst->am&&zleqto(p->q1.val.vlong,cc_set_tst->val.vlong)){
  633.                         if(DEBUG&512){fprintf(f,"; tst eliminated: cc=");probj(f,cc_set_tst,t,0);
  634.                                       fprintf(f,", q1=");probj(f,&p->q1,t,0);fprintf(f,"\n");}
  635.                         continue;
  636.                     }
  637.                 }
  638.             }
  639.             if(g_flags_val[0].l<68020&&isreg(q1)&&p->q1.reg>=1&&p->q1.reg<=8){
  640.             /*  tst ax gibt es nicht bei <68000 :-( */
  641.                 if(regavailable(1)){
  642.                     fprintf(f,"\tmove.%c\t%s,%s\n",x_t[t&15],regnames[p->q1.reg],regnames[get_reg(f,1,p)]);
  643.                 }else{
  644.                     fprintf(f,"\tcmp.w\t#0,%s\n",regnames[p->q1.reg]);
  645.                 }
  646.                 continue;
  647.             }
  648.             if((t==DOUBLE||t==FLOAT)&&g_flags_val[1].l<68000){
  649.             /*  nicht sehr schoen   */
  650.                 int result=get_reg(f,1,p);
  651.                 saveregs(f,p);
  652.                 assign(f,p,&p->q1,0,PUSH,sizetab[t&15],t);
  653.                 fprintf(f,"\tpublic\t__ieeetst%c\n\tjsr\t__ieeetst%c\n\taddq.w\t#%d,a7\n",x_t[t&15],x_t[t&15],sizetab[t&15]);
  654.                 stackoffset+=sizetab[t&15];
  655.                 restoreregsa(f,p);
  656.                 if(result!=9) fprintf(f,"\tmove.l\td0,%s\n",regnames[result]);
  657.                 fprintf(f,"\ttst.l\t%s\n",regnames[result]);
  658.                 restoreregsd(f,p);
  659.                 continue;
  660.             }
  661.             fprintf(f,"\t%stst.%c\t",fp,x_t[t&15]);probj(f,&p->q1,t,0);
  662.             fprintf(f,"\n");
  663.             continue;
  664.         }
  665.         if(c==ASSIGN||c==PUSH||c==POP){
  666.             if(c==ASSIGN&&compare_objects(&p->q1,&p->z)) cc_set=0;
  667.             assign(f,p,&p->q1,&p->z,c,p->q2.reg,t);
  668.             continue;
  669.         }
  670.         if(c==ADDRESS){
  671.             int zreg;
  672.             if(isreg(z)&&p->z.reg>=1&&p->z.reg<=8)
  673.                 zreg=p->z.reg; else zreg=get_reg(f,0,p);
  674.             fprintf(f,"\tlea\t");probj(f,&p->q1,t,0);
  675.             fprintf(f,",%s\n",regnames[zreg]);
  676.             if(!isreg(z)||p->z.reg!=zreg){
  677.                 move(f,0,zreg,&p->z,0,POINTER);
  678.             }
  679.             continue;
  680.         }
  681.         if(c==COMPARE){
  682.             int zreg;
  683.             comptyp=t;
  684.             if((p->q1.flags&KONST)||isreg(q2)){
  685.             /*  evtl. Argumente von cmp und nachfolgendes bcc umdrehen  */
  686.                 struct IC *n;struct obj m;
  687.                 n=p->next;
  688.                 while(n){
  689.                     if(n->code>=BEQ&&n->code<BRA){
  690.                         if(!p->z.flags){
  691.                             if(DEBUG&1) printf("arguments of cmp exchanged\n");
  692.                             m=p->q1;p->q1=p->q2;p->q2=m;
  693.                             p->z.flags=1;
  694.                         }
  695.                         /*  nachfolgenden Branch umdrehen   */
  696.                         switch(n->code){
  697.                             case BGT: n->code=BLT;break;
  698.                             case BLT: n->code=BGT;break;
  699.                             case BGE: n->code=BLE;break;
  700.                             case BLE: n->code=BGE;break;
  701.                         }
  702.                         break;
  703.                     }
  704.                     if(n->code==FREEREG) n=n->next; else break; /*  compare ohne branch => leerer Block o.ae.   */
  705.                 }
  706.             }
  707.             if(t==FLOAT||t==DOUBLE){
  708.                 if(g_flags_val[1].l>=68000){
  709.                     if(isreg(q1)&&p->q1.reg>=17){
  710.                         zreg=p->q1.reg;
  711.                     }else{
  712.                         zreg=get_reg(f,2,p);
  713.                         move(f,&p->q1,0,0,zreg,t);
  714.                     }
  715.                     fprintf(f,"\tfcmp.%c\t",x_t[t&15]);probj(f,&p->q2,t,0);
  716.                     fprintf(f,",%s\n",regnames[zreg]);
  717.                     continue;
  718.                 }else{
  719.                 /*  nicht sehr schoen   */
  720.                     int result=get_reg(f,1,p);
  721.                     saveregs(f,p);
  722.                     assign(f,p,&p->q1,0,PUSH,sizetab[t&15],t);
  723.                     assign(f,p,&p->q2,0,PUSH,sizetab[t&15],t);
  724.                     fprintf(f,"\tpublic\t__ieeecmp%c\n\tjsr\t__ieeecmp%c\n\tadd.w\t#%d,a7\n",x_t[t&15],x_t[t&15],2*sizetab[t&15]);
  725.                     stackoffset+=2*sizetab[t&15];
  726.                     restoreregsa(f,p);
  727.                     if(result!=9) fprintf(f,"\tmove.l\td0,%s\n",regnames[result]);
  728.                     fprintf(f,"\ttst.l\t%s\n",regnames[result]);
  729.                     restoreregsd(f,p);
  730.                     continue;
  731.                 }
  732.             }
  733.             if(p->q2.flags&KONST){
  734.                 fprintf(f,"\tcmp.%c\t",x_t[t&15]);probj(f,&p->q2,t,0);
  735.                 fprintf(f,",");probj(f,&p->q1,t,0);fprintf(f,"\n");
  736.                 continue;
  737.             }
  738.             if(isreg(q1)){
  739.                 zreg=p->q1.reg;
  740.             }else{
  741.                 zreg=get_reg(f,1,p);    /* hier evtl. auch Adressregister nehmen */
  742.                 move(f,&p->q1,0,0,zreg,t);
  743.             }
  744.             fprintf(f,"\tcmp.%c\t",x_t[t&15]);probj(f,&p->q2,t,0);
  745.             fprintf(f,",%s\n",regnames[zreg]);
  746.             continue;
  747.         }
  748.         if(c==ADDI2P||c==SUBIFP){
  749.             int zreg;
  750.             if(compare_objects(&p->q1,&p->z)){
  751.                 int r;
  752.                 if(p->q2.flags&KONST){
  753.                     if(c==ADDI2P)
  754.                         fprintf(f,"\tadd%s.l\t",quick[isquickkonst2(&p->q2.val,t)]);
  755.                     else
  756.                         fprintf(f,"\tsub%s.l\t",quick[isquickkonst2(&p->q2.val,t)]);
  757.                     probj(f,&p->q2,t,0);fprintf(f,",");
  758.                     probj(f,&p->z,POINTER,0);fprintf(f,"\n");
  759.                     continue;
  760.                 }
  761.                 if(isreg(q1)&&(x_t[t&15]=='l'||p->q1.reg<=8)){
  762.                     if(c==ADDI2P)
  763.                         fprintf(f,"\tadd.%c\t",x_t[t&15]);
  764.                     else
  765.                         fprintf(f,"\tsub.%c\t",x_t[t&15]);
  766.                     probj(f,&p->q2,t,0);fprintf(f,",%s\n",regnames[p->z.reg]);
  767.                     continue;
  768.                 }
  769.                 if(isreg(q2)&&p->q2.reg>=1){
  770.                     r=p->q2.reg;
  771.                 }else{
  772.                     r=get_reg(f,1,p);
  773.                     move(f,&p->q2,0,0,r,t);
  774.                 }
  775.                 if(x_t[t&15]!='l'&&(!isreg(z)||p->z.reg<1||p->z.reg>8)){
  776.                 /*  wenn Ziel kein Adressregister, muss short erst auf long */
  777.                 /*  char darf hier nicht auftreteten und long passt schon   */
  778.                     if(t&UNSIGNED) fprintf(f,"\tswap\t%s\n\tclr.w\t%s\n\tswap\t%s\n",regnames[r],regnames[r],regnames[r]);
  779.                      else          fprintf(f,"\text.l\t%s\n",regnames[r]);
  780.                     t=POINTER;
  781.                 }
  782. /*                if(c==ADDI2P)
  783.                     fprintf(f,"\tadd.%c\t%s,",x_t[t&15],regnames[r]);
  784.                 else
  785.                     fprintf(f,"\tsub.%c\t%s,",x_t[t&15],regnames[r]);
  786.                 probj(f,&p->z,t,0);fprintf(f,"\n");*/
  787.                 if(c==ADDI2P) add(f,0,r,&p->z,0,t);
  788.                  else         sub(f,0,r,&p->z,0,t);
  789.                 continue;
  790.             }
  791.             if(isreg(z)&&p->z.reg>=1&&p->z.reg<=16)
  792.                 zreg=p->z.reg; else zreg=get_reg(f,0,p);
  793.             /*  Spezialfall, falls Ziel Datenregister und short */
  794.             /*  nicht schoen, aber auf die Schnelle...          */
  795.             if(x_t[t&15]!='l'&&zreg>8){
  796.                 move(f,&p->q2,0,0,zreg,t);
  797.                 if(t&UNSIGNED) fprintf(f,"\tswap\t%s\n\tclr.w\t%s\n\tswap\t%s\n",regnames[zreg],regnames[zreg],regnames[zreg]);
  798.                  else          fprintf(f,"\text.l\t%s\n",regnames[zreg]);
  799.                 if(c==SUBIFP) fprintf(f,"\tneg.l\t%s\n",regnames[zreg]);
  800.                 add(f,&p->q1,0,0,zreg,POINTER);
  801.                 if(!isreg(z)||p->z.reg!=zreg)
  802.                     move(f,0,zreg,&p->z,0,POINTER);
  803.                 continue;
  804.             }
  805.             if(!isreg(q1)||p->q1.reg!=zreg){
  806.                 move(f,&p->q1,0,0,zreg,POINTER);
  807.             }
  808.             if(c==ADDI2P) add(f,&p->q2,0,0,zreg,t);
  809.              else         sub(f,&p->q2,0,0,zreg,t);
  810.             if(!isreg(z)||p->z.reg!=zreg){
  811.                 move(f,0,zreg,&p->z,0,POINTER);
  812.             }
  813.             continue;
  814.         }
  815.         if((c>=OR&&c<=AND)||(c>=LSHIFT&&c<=MOD)){
  816.             int zreg,q1reg,q2reg,divflag=0;
  817.             if((p->q2.flags&KONST)&&
  818.                (!(p->q1.flags®)||!(p->z.flags®)||p->q1.reg!=p->z.reg)&&
  819.                (!(p->q1.flags&VAR)||!(p->z.flags&VAR)||p->q1.v!=p->z.v)&&
  820.                ((c>=OR&&c<=AND)||c==ADD||c==MULT)){
  821.                 struct obj o;
  822.                 if(c==MULT){
  823.                     eval_const(&p->q2.val,t);
  824.                     if(zlleq(l2zl(0L),vlong)&&zulleq(ul2zul(0UL),vulong)&&!pof2(vulong)){
  825.                         o=p->q1;p->q1=p->q2;p->q2=o;
  826.                     }
  827.                 }else{
  828.                     o=p->q1;p->q1=p->q2;p->q2=o;
  829.                 }
  830.             }
  831.             if(t==FLOAT||t==DOUBLE){
  832.                 if(g_flags_val[1].l>=68000){
  833.                     if(isreg(z)&&p->z.reg>=17) zreg=p->z.reg;
  834.                         else zreg=get_reg(f,2,p);
  835.                     if(!isreg(q1)||p->q1.reg!=p->z.reg)
  836.                         move(f,&p->q1,0,0,zreg,t);
  837.                     fprintf(f,"\tf%s.%c\t",ename[c],x_t[t&15]);probj(f,&p->q2,t,0);
  838.                     fprintf(f,",%s\n",regnames[zreg]);
  839.                     if(!isreg(z)||p->z.reg!=zreg){
  840.                         move(f,0,zreg,&p->z,0,t);
  841.                     }
  842.                     continue;
  843.                 }else{
  844.                     saveregs(f,p);
  845.                     assign(f,p,&p->q1,0,PUSH,sizetab[t&15],t);
  846.                     assign(f,p,&p->q2,0,PUSH,sizetab[t&15],t);
  847.                     fprintf(f,"\tpublic\t__ieee%s%c\n\tjsr\t__ieee%s%c\n\tadd.w\t#%d,a7\n",ename[c],x_t[t&15],ename[c],x_t[t&15],2*sizetab[t&15]);
  848.                     stackoffset+=2*sizetab[t&15];
  849.                     restoreregsa(f,p);
  850.                     if(t==DOUBLE){
  851.                         fprintf(f,"\tmovem.l\td0/d1,");
  852.                         probj(f,&p->z,0,t);fprintf(f,"\n");
  853.                     }else move(f,0,9,&p->z,0,t);
  854.                     restoreregsd(f,p);
  855.                     continue;
  856.                 }
  857.             }
  858.             if((c==MULT||c==DIV||(c==MOD&&(p->typf&UNSIGNED)))&&(p->q2.flags&KONST)){
  859.             /*  ersetzt mul etc. mit Zweierpotenzen     */
  860.             /*  hier evtl. noch Fehler                  */
  861.                 long ln;
  862.                 eval_const(&p->q2.val,t);
  863.                 if(zlleq(l2zl(0L),vlong)&&zulleq(ul2zul(0UL),vulong)){
  864.                     if(ln=pof2(vulong)){
  865.                         if(c==MOD){
  866.                             vlong=zlsub(vlong,l2zl(1L));
  867.                             p->code=AND;
  868.                         }else{
  869.                             vlong=l2zl(ln-1);
  870.                             if(c==DIV) {divflag=1;p->code=RSHIFT;} else p->code=LSHIFT;
  871.                         }
  872.                         c=p->code;
  873.                         if((t&31)==CHAR) p->q2.val.vchar=zl2zc(vlong);
  874.                         if((t&31)==SHORT) p->q2.val.vshort=zl2zs(vlong);
  875.                         if((t&31)==INT) p->q2.val.vint=zl2zi(vlong);
  876.                         if((t&31)==LONG) p->q2.val.vlong=vlong;
  877.                         vulong=zl2zul(vlong);
  878.                         if((t&31)==(UNSIGNED|CHAR)) p->q2.val.vuchar=zul2zuc(vulong);
  879.                         if((t&31)==(UNSIGNED|SHORT)) p->q2.val.vushort=zul2zus(vulong);
  880.                         if((t&31)==(UNSIGNED|INT))  p->q2.val.vuint=zul2zui(vulong);
  881.                         if((t&31)==(UNSIGNED|LONG)) p->q2.val.vulong=vulong;
  882.                     }
  883.                 }
  884.             }
  885.             if(c==DIV||c==MOD){
  886.                 if(x_t[t&15]=='l'&&g_flags_val[0].l<68020){
  887.                 /*  das hier ist auch nicht allzu schoen  */
  888.                     char *fname;
  889.                     cc_set=0;   /*  Library-Funktionen setzen cc nicht immer */
  890.                     saveregs(f,p);
  891.                     fprintf(f,"\tmove.l\t"); probj(f,&p->q2,t,0);
  892.                     fprintf(f,",-(a7)\n");
  893.                     stackoffset-=4;
  894.                     fprintf(f,"\tmove.l\t"); probj(f,&p->q1,t,0);
  895.                     fprintf(f,",-(a7)\n");
  896.                     stackoffset-=4;
  897.                     if(c==DIV){
  898.                         if(t&UNSIGNED) fname="divu"; else fname="divs";
  899.                     }else{
  900.                         if(t&UNSIGNED) fname="modu"; else fname="mods";
  901.                     }
  902.                     fprintf(f,"\tpublic\t__l%s\n",fname);
  903.                     fprintf(f,"\tjsr\t__l%s\n",fname);
  904.                     fprintf(f,"\taddq.w\t#8,a7\n");
  905.                     stackoffset+=8;
  906.                     restoreregsa(f,p);
  907.                     move(f,0,9,&p->z,0,t);
  908.                     restoreregsd(f,p);
  909.                     continue;
  910.                 }
  911.  
  912.             }
  913.             /*  hier die zweite Alternative mit isreg() schreiben?  */
  914.             if(compare_objects(&p->q2,&p->z)){
  915.                 struct obj m;
  916.                 if((c>=OR&&c<=AND)||c==ADD||c==SUB){
  917.                     if(c!=SUB){
  918.                         m=p->q1;p->q1=p->q2;p->q2=m;
  919.                     }else{
  920.                         if(isreg(q2)&&p->q2.reg>=9&&p->q2.reg<=16){
  921.                             m=p->q1;p->q1=p->q2;p->q2=m;
  922.                             c=ADD;
  923.                             fprintf(f,"\tneg.%c\t",x_t[t&15]);
  924.                             probj(f,&p->q1,t,0);fprintf(f,"\n");
  925.                         }
  926.                     }
  927.                 }
  928.             }
  929.             if(compare_objects(&p->q1,&p->z)){
  930.                 if((c>=OR&&c<=AND)||c==ADD||c==SUB){
  931.                     int r;
  932.                     if(p->q2.flags&KONST){
  933.                         if(c==ADD) {add(f,&p->q2,0,&p->z,0,t);continue;}
  934.                         if(c==SUB) {sub(f,&p->q2,0,&p->z,0,t);continue;}
  935.                         fprintf(f,"\t%s.%c\t",ename[c],x_t[t&15]);
  936.                         probj(f,&p->q2,t,0);fprintf(f,",");
  937.                         probj(f,&p->z,t,0);fprintf(f,"\n");
  938.                         continue;
  939.                     }
  940.                     if(!isreg(z)){
  941.                         if(isreg(q2)&&p->q2.reg>=9&&p->q2.reg<=16)
  942.                             r=p->q2.reg; else r=get_reg(f,1,p);
  943.                         if(!isreg(q2)||p->q2.reg!=r){
  944.                             move(f,&p->q2,0,0,r,t);
  945.                         }
  946.                         fprintf(f,"\t%s.%c\t%s,",ename[c],x_t[t&15],regnames[r]);
  947.                         probj(f,&p->z,t,0);fprintf(f,"\n");
  948.                         continue;
  949.                     }
  950.                 }
  951.             }
  952.             /*  bei xor oder asl (ausser 0<=const<=8) muss q2 in Register   */
  953.             if(isreg(q2)&&p->q2.reg>=9&&p->q2.reg<=16){
  954.                 q2reg=p->q2.reg;
  955.             }else{
  956.                 if(c==LSHIFT||c==RSHIFT||c==XOR){
  957.                     eval_const(&p->q2.val,t);
  958.                     if(c==XOR||!(p->q2.flags&KONST)||!isquickkonst2(&p->q2.val,t)){
  959.                         q2reg=get_reg(f,1,p);
  960.                         move(f,&p->q2,0,0,q2reg,t);
  961.                     }else q2reg=0;
  962.                 }else{
  963.                     q2reg=0;
  964.                 }
  965.             }
  966.             if(c==MOD){
  967.                 int modreg;
  968.                 modreg=get_reg(f,1,p);
  969.                 if(isreg(z)&&p->z.reg>=9&&p->z.reg<=16&&p->z.reg!=q2reg)
  970.                     zreg=p->z.reg; else zreg=get_reg(f,1,p);
  971.                 move(f,&p->q1,0,0,modreg,t);
  972.                 if(0 /*g_flags_val[0].l==68060*/){
  973.                 /*  div?l.l wird da emuliert?   */
  974.                     fprintf(f,"\tsmi\t%s\n\textb.l\t%s\n",regnames[zreg],regnames[zreg]);
  975.                     if(t&UNSIGNED) fprintf(f,"\tdivu.%c\t",x_t[t&15]); else fprintf(f,"\tdivs.%c\t",x_t[t&15]);
  976.                 }else{
  977.                     if(t&UNSIGNED) fprintf(f,"\tdivul.%c\t",x_t[t&15]); else fprintf(f,"\tdivsl.%c\t",x_t[t&15]);
  978.                 }
  979.                 probj(f,&p->q2,t,0);
  980.                 fprintf(f,",%s:%s\n",regnames[zreg],regnames[modreg]);
  981.                 move(f,0,zreg,&p->z,0,t);
  982.                 cc_set=0;
  983.                 continue;
  984.             }
  985.             if(isreg(z)&&p->z.reg>=9&&p->z.reg<=16&&p->z.reg!=q2reg)
  986.                 zreg=p->z.reg; else zreg=get_reg(f,1,p);
  987.             if(isreg(q1)&&p->q1.reg>=9&&p->q1.reg<=16)
  988.                 q1reg=p->q1.reg; else q1reg=0;
  989.             if(q1reg!=zreg){
  990.                 move(f,&p->q1,0,0,zreg,t);
  991.             }
  992.             if(c!=MULT&&c!=DIV&&c!=MOD&&c!=ADD&&c!=SUB){
  993.                 if(c==RSHIFT&&divflag&&!(t&UNSIGNED)) fprintf(f,"\tasr.%c\t",x_t[t&15]);
  994.                  else fprintf(f,"\t%s.%c\t",ename[c],x_t[t&15]);
  995.                 if(q2reg) fprintf(f,"%s",regnames[q2reg]); else probj(f,&p->q2,t,0);
  996.                 fprintf(f,",%s\n",regnames[zreg]);
  997.             }else{
  998.                 if(c==ADD) add(f,&p->q2,q2reg,0,zreg,t);
  999.                 if(c==SUB) sub(f,&p->q2,q2reg,0,zreg,t);
  1000.                 if(c==MULT||c==DIV||c==MOD) mult(f,&p->q2,q2reg,0,zreg,t,c,p);
  1001.             }
  1002.             if((!isreg(z)||p->z.reg!=zreg)){
  1003.                 move(f,0,zreg,&p->z,0,t);
  1004.             }
  1005.             continue;
  1006.         }
  1007.         ierror(0);
  1008.     }
  1009.     if(notpopped){
  1010.         fprintf(f,"\tadd%s.%s\t#%ld,a7\n",quick[notpopped<=8],strshort[notpopped<32768],notpopped);
  1011.         stackoffset+=notpopped;notpopped=0;
  1012.     }
  1013.     function_bottom(f,v,offset);
  1014.     if(pushflag){   /*  Speicher fuer pushlabel generieren - leider im cseg */
  1015.         fprintf(f,"\tcnop\t0,4\nl%d\n\tds.b\t4\n",pushlabel);
  1016.         pushflag=0;
  1017.     }
  1018. }
  1019. int pget_reg(FILE *f,int flag,struct IC *p)
  1020. /*  wie get_reg, fuer den Fall, dass waehrend PUSH etwas auf den Stack muss */
  1021. {
  1022.     int i;
  1023.     flag=1+flag*8;
  1024.     for(i=flag;i<flag+8;i++){
  1025.         if(regs[i]==1&&(!p||(i!=p->q1.reg&&i!=p->q2.reg&&i!=p->z.reg))){
  1026.             if(p){
  1027.                 if((p->q1.am&&(p->q1.am->dreg==i||p->q1.am->basereg==i))
  1028.                  ||(p->q2.am&&(p->q2.am->dreg==i||p->q2.am->basereg==i))
  1029.                  ||(p->z.am&&(p->z.am->dreg==i||p->z.am->basereg==i))){
  1030.                     continue;
  1031.                 }
  1032.             }
  1033.             regs[i]+=8;if(!pushlabel) {pushlabel=++label;pushflag=1;}
  1034.             fprintf(f,"\tmove.l\t%s,l%d\n",regnames[i],pushlabel);
  1035.             if(i<9) pushedreg|=2;
  1036.             else if (i<17) pushedreg|=4;
  1037.             else pushedreg|=8;
  1038.             return(i);
  1039.         }
  1040.     }
  1041.     ierror(0);
  1042. }
  1043. int get_reg(FILE *f,int flag,struct IC *p)
  1044. /*  Besorgt Register flag=0=areg, 1=dreg, 2=fpreg           */
  1045. {
  1046.     int i;
  1047.     flag=1+flag*8;
  1048.     for(i=flag;i<flag+8;i++){
  1049.         if(regs[i]==0){
  1050.             if(p){
  1051.                 if((p->q1.am&&(p->q1.am->dreg==i||p->q1.am->basereg==i))
  1052.                  ||(p->q2.am&&(p->q2.am->dreg==i||p->q2.am->basereg==i))
  1053.                  ||(p->z.am&&(p->z.am->dreg==i||p->z.am->basereg==i))){
  1054. /*                    iwarning("%s used in get_reg(1)",regnames[i]);*/
  1055.                     continue;
  1056.                 }
  1057.             }
  1058.             regs[i]=2;pushedreg|=1;
  1059.             if(!regused[i]&&!regscratch[i]){regused[i]=1; }
  1060.             return(i);
  1061.         }
  1062.     }
  1063.     for(i=flag;i<flag+8;i++){
  1064.         if(regs[i]==1&&(!p||(i!=p->q1.reg&&i!=p->q2.reg&&i!=p->z.reg))){
  1065.             if(p){
  1066.                 if((p->q1.am&&(p->q1.am->dreg==i||p->q1.am->basereg==i))
  1067.                  ||(p->q2.am&&(p->q2.am->dreg==i||p->q2.am->basereg==i))
  1068.                  ||(p->z.am&&(p->z.am->dreg==i||p->z.am->basereg==i))){
  1069. /*                    iwarning("%s used in get_reg(2)",regnames[i]);*/
  1070.                     continue;
  1071.                 }
  1072.             }
  1073.             regs[i]+=4;
  1074.             if(i<17) {fprintf(f,"\tmove.l\t%s,-(a7)\n",regnames[i]);stackoffset-=4;}
  1075.              else {fprintf(f,"\tfmove.x\t%s,-(a7)\n",regnames[i]);stackoffset-=12;}
  1076. /*            if(p->code==COMPARE) ierror("corrupt code for compare generated - sorry");*/
  1077.             if(i<9) pushedreg|=2;
  1078.             else if (i<17) pushedreg|=4;
  1079.             else pushedreg|=8;
  1080.             return(i);
  1081.         }
  1082.     }
  1083.     ierror(0);
  1084. }
  1085.  
  1086. int isquickkonst(union atyps *p,int t)
  1087. /*  liefert 1, wenn p auf Konstante zwischen -128 und 127 ist   */
  1088. {
  1089.     zlong zl;zulong zul;
  1090.     eval_const(p,t);
  1091.     if(t&UNSIGNED){
  1092.         zul=ul2zul(127UL);
  1093.         return(zulleq(vulong,zul));
  1094.     }else{
  1095.         zl=l2zl(-129L);
  1096.         if(zlleq(vlong,zl)) return(0);
  1097.         zl=l2zl(127L);
  1098.         return(zlleq(vlong,zl));
  1099.     }
  1100. }
  1101. int isquickkonst2(union atyps *p,int t)
  1102. /*  liefert 1, wenn p auf Konstante zwischen 0 und 8 ist   */
  1103. {
  1104.     zlong zl;zulong zul;
  1105.     eval_const(p,t);
  1106.     if(t&UNSIGNED){
  1107.         if(zuleq(vulong)) return(0);
  1108.         zul=ul2zul(8UL);
  1109.         return(zulleq(vulong,zul));
  1110.     }else{
  1111.         if(zleq(vlong)) return(0);
  1112.         zl=l2zl(-1L);
  1113.         if(zlleq(vlong,zl)) return(0);
  1114.         zl=l2zl(8L);
  1115.         return(zlleq(vlong,zl));
  1116.     }
  1117. }
  1118. int regavailable(int art)
  1119. /*  liefert true, wenn Register mit art frei ist, sonst 0       */
  1120. {
  1121.     int i;
  1122.     art=1+art*8;
  1123.     for(i=art+1;i<art+8;i++)
  1124.         if(regs[i]==0) return(1);
  1125.     return(0);
  1126. }
  1127.  
  1128. int compare_objects(struct obj *o1,struct obj *o2)
  1129. /*  Vergleicht, ob die beiden Objekte fuer d0_refs gleich sind  */
  1130. {
  1131.     if(o1->flags==o2->flags){
  1132.         if(!(o1->flags&VAR)||(o1->v==o2->v&&zleqto(o1->val.vlong,o2->val.vlong))){
  1133.             if(!(o1->flags®)||o1->reg==o2->reg){
  1134.                 return(1);
  1135.             }
  1136.         }
  1137.     }
  1138.     return(0);
  1139. }
  1140.  
  1141. struct IC *do_refs(FILE *f,struct IC *p)
  1142. /*  Kopiert DREFOBJs in Adressregister, wenn noetig         */
  1143. /*  und kleine Konstanten in Datenregister                  */
  1144. /*  zerstoert die ICs dabei so, dass kein zweiter Pass      */
  1145. /*  moeglich ist (was aber durch reg/freg garantiert ist).  */
  1146. {
  1147.     int reg,c=p->code,t=p->typf,equal;
  1148.     if((p->q1.flags&DREFOBJ)&&(!(p->q1.flags®)||p->q1.reg<1||p->q1.reg>8)){
  1149.         equal=0;
  1150.         if(compare_objects(&p->q1,&p->q2)) equal|=1;
  1151.         if(compare_objects(&p->q1,&p->z)) equal|=2;
  1152.         reg=get_reg(f,0,p);
  1153.         p->q1.flags&=~DREFOBJ;
  1154.         fprintf(f,"\tmove.l\t");probj(f,&p->q1,t,0);
  1155.         p->q1.flags=REG|SCRATCH|DREFOBJ;
  1156.         p->q1.reg=reg;
  1157.         fprintf(f,",%s\n",regnames[p->q1.reg]);
  1158.         if(equal&1) p->q2=p->q1;
  1159.         if(equal&2) p->z=p->q1;
  1160.     }
  1161.     if((p->q2.flags&DREFOBJ)&&(!(p->q2.flags®)||p->q2.reg<1||p->q2.reg>8)){
  1162.         if(compare_objects(&p->q2,&p->z)) equal=1; else equal=0;
  1163.         reg=get_reg(f,0,p);
  1164.         p->q2.flags&=~DREFOBJ;
  1165.         fprintf(f,"\tmove.l\t");probj(f,&p->q2,t,0);
  1166.         p->q2.flags=REG|SCRATCH|DREFOBJ;
  1167.         p->q2.reg=reg;
  1168.         fprintf(f,",%s\n",regnames[p->q2.reg]);
  1169.         if(equal) p->z=p->q2;
  1170.     }
  1171.     if((p->z.flags&DREFOBJ)&&(!(p->z.flags®)||p->z.reg<1||p->z.reg>8)){
  1172.         reg=get_reg(f,0,p);
  1173.         p->z.flags&=~DREFOBJ;
  1174.         fprintf(f,"\tmove.l\t");probj(f,&p->z,t,0);
  1175.         p->z.flags=REG|SCRATCH|DREFOBJ;
  1176.         p->z.reg=reg;
  1177.         fprintf(f,",%s\n",regnames[p->z.reg]);
  1178.     }
  1179.     if(g_flags_val[0].l<68040){
  1180.     /*  bei 040/060 ist das langsamer, also lassen wir es   */
  1181.         if(x_t[t&15]=='l'&&(t&15)!=FLOAT&&(c!=ASSIGN||!isreg(z))&&
  1182.            c!=MULT&&c!=DIV&&c!=MOD&&c!=LSHIFT&&c!=RSHIFT&&c!=SETRETURN&&c!=PUSH&&
  1183.            (!(p->z.flags®)||p->z.reg<9||p->z.reg>16)){
  1184.         /*  Konstanten evtl. in Register, noch nicht getestet   */
  1185.             if((p->q1.flags&KONST)&&isquickkonst(&p->q1.val,t)&&((c!=ADD&&c!=SUB&&c!=ADDI2P&&c!=SUBIFP)||!isquickkonst2(&p->q1.val,t))){
  1186.                 if(regavailable(1)){
  1187.                     reg=get_reg(f,1,p);
  1188.                     move(f,&p->q1,0,0,reg,t);
  1189.                     p->q1.flags=REG|SCRATCH;p->q1.reg=reg;
  1190.                     p->q1.val.vlong=l2zl(0L);
  1191.                 }
  1192.             }
  1193.             if((p->q2.flags&KONST)&&isquickkonst(&p->q2.val,t)&&((c!=ADD&&c!=SUB&&c!=ADDI2P&&c!=SUBIFP)||!isquickkonst2(&p->q2.val,t))){
  1194.                 if(regavailable(1)){
  1195.                     reg=get_reg(f,1,p);
  1196.                     move(f,&p->q2,0,0,reg,t);
  1197.                     p->q2.flags=REG|SCRATCH;p->q2.reg=reg;
  1198.                     p->q2.val.vlong=l2zl(0L);
  1199.                 }
  1200.             }
  1201.         }
  1202.     }
  1203.     return(p);
  1204. }
  1205. void pr(FILE *f,struct IC *p)
  1206. /*  Gibt Register frei, holt sie vom Stack                  */
  1207. {
  1208.     int i,size=0;
  1209.     /*  Haufen Gefummel um condition codes zu merken    */
  1210.     if((pushedreg&12)&&(p->code==TEST||p->code==COMPARE)){
  1211.         char *fp;struct IC *branch;
  1212.         if(g_flags_val[1].l>=68000&&((p->typf&15)==FLOAT||(p->typf&15)==DOUBLE)) fp="f"; else fp="";
  1213.         branch=p;
  1214.         while(branch->code<BEQ||branch->code>=BRA) branch=branch->next;
  1215.         if((p->typf&UNSIGNED)||(p->typf&15)==POINTER){
  1216.             fprintf(f,"\ts%s\t-2(a7)\n",ubranch[branch->code-BEQ]+1);
  1217.         }else{
  1218.             fprintf(f,"\t%ss%s\t-2(a7)\n",fp,ename[branch->code]+1);
  1219.         }
  1220.         stored_cc=1;
  1221.     }
  1222.     for(i=MAXR;i>0;i--){
  1223.         if(regs[i]==2) regs[i]=0;
  1224.         if(regs[i]&8){
  1225.             regs[i]&=~8;
  1226.             fprintf(f,"\tmove.l\tl%d,%s\n",pushlabel,regnames[i]);
  1227.             if(i>=9) cc_set=0;
  1228.         }
  1229.         if(regs[i]&4){
  1230.             regs[i]&=~4;
  1231.             if(i<17) {fprintf(f,"\tmove.l\t(a7)+,%s\n",regnames[i]);stackoffset+=4;size+=4;}
  1232.              else {fprintf(f,"\tfmove.x\t(a7)+,%s\n",regnames[i]);stackoffset+=12;size+=12;}
  1233.             if(i>=9) cc_set=0;
  1234.         }
  1235.     }
  1236.     if((pushedreg&12)&&(p->code==TEST||p->code==COMPARE))
  1237.         fprintf(f,"\ttst.b\t-%d(a7)\n",size+2);
  1238. }
  1239.  
  1240. void probj(FILE *f,struct obj *p,int t,int verbose)
  1241. /*  Gibt Objekt auf Bildschirm aus                      */
  1242. {
  1243.     if(p->am){
  1244.     /*  Ausgabe der erweiterten Adressierungsarten  */
  1245.         if(g_flags[9]&USEDFLAG) {ierror(0);p->am=0;return;}
  1246.         if(p->am->skal>=0){
  1247.             long l=0;
  1248.             if(p->flags&D16OFF) l=zl2l(p->val.vlong);
  1249.             fprintf(f,"(%ld,%s",p->am->dist+l,regnames[p->am->basereg]);
  1250.             if(p->am->dreg){
  1251.                 fprintf(f,",%s",regnames[p->am->dreg&127]);
  1252.                 if(p->am->dreg&128) fprintf(f,".w"); else fprintf(f,".l");
  1253.                 if(p->am->skal) fprintf(f,"*%d",p->am->skal);
  1254.             }
  1255.             fprintf(f,")");
  1256.             return;
  1257.         }
  1258.         if((p->flags&D16OFF)&&!zleq(p->val.vlong)) ierror(0);
  1259.         if(p->am->skal==-1){
  1260.             fprintf(f,"(%s)+",regnames[p->am->basereg]);
  1261.             return;
  1262.         }
  1263.         if(p->am->skal==-2){    /*  Noch nicht implementiert    */
  1264.             fprintf(f,"-(%s)",regnames[p->am->basereg]);
  1265.             return;
  1266.         }
  1267.     }
  1268.     if(p->flags&DREFOBJ){
  1269.         fprintf(f,"(");
  1270.         if((p->flags&D16OFF)&&!zleq(p->val.vlong))
  1271.             {printval(f,&p->val,LONG,0);fprintf(f,",");}
  1272.     }
  1273.     if((p->flags&VARADR)&&!(verbose&2)) fprintf(f,"#");
  1274.     if(p->flags&VAR) {
  1275.         if(verbose&1){
  1276.             printval(f,&p->val,LONG,1);
  1277.             if(p->v->storage_class==AUTO||p->v->storage_class==REGISTER){
  1278.                 if(p->flags®)
  1279.                     fprintf(f,"+%s",regnames[p->reg]);
  1280.                 else
  1281.                     fprintf(f,"+%d(FP)", p->v->offset);
  1282.             }else{
  1283.                 if(p->v->storage_class==STATIC&&p->v->nesting>0){
  1284.                     fprintf(f,"+L%d",p->v->offset);
  1285.                 }else{
  1286.                     fprintf(f,"+_%s",p->v->identifier);
  1287.                 }
  1288.             }
  1289.             fprintf(f,"(%s)",p->v->identifier);
  1290.         }else{
  1291.             if(p->v->storage_class==AUTO||p->v->storage_class==REGISTER){
  1292.                 if(p->flags®){
  1293.                     fprintf(f,"%s",regnames[p->reg]);
  1294.                 }else{
  1295.                     long os;
  1296.                     os=zl2l(p->val.vlong);
  1297.                     if(!(g_flags[8]&USEDFLAG)){
  1298.                         if(p->v->offset<0) os=os+loff-p->v->offset;
  1299.                          else              os=os+p->v->offset;
  1300.                         fprintf(f,"(%ld+l%d,a7)",os-stackoffset,offlabel);
  1301.                     }else{
  1302.                         if(p->v->offset<0) os=os-p->v->offset+4;
  1303.                          else              os=os-(p->v->offset+szof(p->v->vtyp));
  1304.                         fprintf(f,"(%ld,a5)",os);
  1305.                     }
  1306.                 }
  1307.             }else{
  1308.                 if(!zleq(p->val.vlong)){printval(f,&p->val,LONG,0);fprintf(f,"+");}
  1309.                 if(p->v->storage_class==STATIC&&(p->v->vtyp->flags&15)!=FUNKT){
  1310.                     fprintf(f,"l%d",p->v->offset);
  1311.                 }else{
  1312.                     fprintf(f,"_%s",p->v->identifier);
  1313.                     if((g_flags[5]&USEDFLAG)&&!(p->flags&VARADR)&&(p->v->vtyp->flags&15)!=FUNKT)
  1314.                         fprintf(f,"(a4)");
  1315.                 }
  1316.             }
  1317.         }
  1318.     }
  1319.     if((p->flags®)&&!(p->flags&VAR)) fprintf(f,"%s",regnames[p->reg]);
  1320.     if(p->flags&KONST){
  1321.         /*  Das hier setzt voraus, dass Compiler Datentypen im  */
  1322.         /*  IEEE-Format nachbildet                              */
  1323.         if(t==FLOAT||t==DOUBLE){
  1324.             char str[10];int i;
  1325.             int *ip=(int *)&p->val.vfloat; /*   nicht schoen, aber...   */
  1326.             fprintf(f,"#$");sprintf(str,"%8x",*ip);
  1327.             for(i=0;i<8;i++) if(str[i]==' ') str[i]='0';
  1328.             fprintf(f,"%s",str);
  1329.             if(t==DOUBLE){
  1330.                 if(DEBUG&1) printf("doubleconst=%f\n",p->val.vdouble);
  1331.                 ip++;sprintf(str,"%8x",*ip);
  1332.                 for(i=0;i<10;i++) if(str[i]==' ') str[i]='0';
  1333.                 fprintf(f,"%s",str);
  1334.             }
  1335.         }else {fprintf(f,"#");printval(f,&p->val,t&31,verbose);}
  1336.     }
  1337.     if(p->flags&STACK) fprintf(f,"Stack");
  1338.     if(p->flags&DREFOBJ) fprintf(f,")");
  1339. }
  1340. char tsh[]={'w','l'};
  1341. int proflabel;
  1342. void function_top(FILE *f,struct Var *v,int offset)
  1343. /*  erzeugt Funktionskopf                       */
  1344. {
  1345.     if(g_flags_val[0].l!=68000) fprintf(f,"\tmachine\t%ld\n",g_flags_val[0].l);
  1346.     if(g_flags_val[1].l>68000) fprintf(f,"\tfpu\t1\n");
  1347.     if(g_flags[4]&USEDFLAG) fprintf(f,"\tnear\tcode\n");
  1348.     if(g_flags[5]&USEDFLAG) fprintf(f,"\tnear\ta4,-2\n");
  1349.     if(section!=CODE){fprintf(f,codename);section=CODE;}
  1350.     if(g_flags[6]&USEDFLAG){
  1351.         proflabel=++label;
  1352.         fprintf(f,"l%d\n\tdc.b\t\"%s\",0\n",proflabel,v->identifier);
  1353.     }
  1354.     if(v->storage_class==EXTERN) fprintf(f,"\tpublic\t_%s\n",v->identifier);
  1355.     fprintf(f,"\tcnop\t0,4\n_%s\n",v->identifier);
  1356.     if(g_flags[6]&USEDFLAG)
  1357.         fprintf(f,"\tpea\tl%d\n\tpublic\t__startprof\n\tjsr\t__startprof\n\taddq.w\t#4,a7\n",proflabel);
  1358.     offset=-((offset+4-1)/4)*4;
  1359.     loff=-offset;offlabel=++label;
  1360.     if(!(g_flags[8]&USEDFLAG)){
  1361.         if(offset<0) fprintf(f,"\tsub%s.%s\t#%d,a7\n",quick[offset>=-8],strshort[offset>=-32768],-offset);
  1362.     }else{
  1363.         if(offset>=-32768||g_flags_val[0].l>=68020){
  1364.             fprintf(f,"\tlink.%c\ta5,#%d\n",tsh[offset<-32768],offset);
  1365.         }else{
  1366.             fprintf(f,"\tlink.w\ta5,#-32768\n");offset+=32768;
  1367.             fprintf(f,"\tsub.%c\t#%d,a5\n",tsh[offset<-32768],offset);
  1368.         }
  1369.     }
  1370.     if(g_flags_val[1].l>68000&&float_used) fprintf(f,"\tfmovem.x\tl%d,-(a7)\n",freglabel);
  1371.     fprintf(f,"\tmovem.l\tl%d,-(a7)\n",reglabel);
  1372.     /*  Was mach ich hier mit stackoffset?  */
  1373. }
  1374. void function_bottom(FILE *f,struct Var *v,int offset)
  1375. /*  erzeugt Funktionsende                       */
  1376. {
  1377.     int i,size=0;
  1378.     *reglist=0;
  1379.     for(i=1;i<=16;i++){
  1380.         if(regused[i]&&!regscratch[i]&&!regsa[i]){
  1381.             if(*reglist) strcat(reglist,"/");
  1382.             strcat(reglist,regnames[i]);size+=4;
  1383.         }
  1384.     }
  1385.     if(*reglist) fprintf(f,"l%d\treg\t%s\n\tmovem.l\t(a7)+,l%d\n",reglabel,reglist,reglabel);
  1386.         else fprintf(f,"l%d\treg\n",reglabel);
  1387.     *reglist=0;
  1388.     for(i=17;i<=MAXR;i++){
  1389.         if(regused[i]&&!regscratch[i]&&!regsa[i]){
  1390.             if(*reglist) strcat(reglist,"/");
  1391.             strcat(reglist,regnames[i]);size+=12;
  1392.         }
  1393.     }
  1394.     if(g_flags_val[1].l>68000&&float_used){
  1395.         if(*reglist) fprintf(f,"l%d\tfreg\t%s\n\tfmovem.x\t(a7)+,l%d\n",freglabel,reglist,freglabel);
  1396.             else fprintf(f,"l%d\tfreg\n",freglabel);
  1397.     }
  1398.     if(!(g_flags[8]&USEDFLAG)){
  1399.         if(loff) fprintf(f,"\tadd%s.%s\t#%ld,a7\n",quick[loff<=8],strshort[loff<32768],loff);
  1400.         fprintf(f,"l%d\tEQU\t%d\n",offlabel,size);
  1401.     }else fprintf(f,"\tunlk\ta5\n");
  1402.     if(g_flags[6]&USEDFLAG)
  1403.         fprintf(f,"\tpea\tl%d\n\tpublic\t__endprof\n\tjsr\t__endprof\n\taddq.w\t#4,a7\n",proflabel);
  1404.     fprintf(f,"\trts\n");
  1405. }
  1406. void gen_ds(FILE *f,int size,struct Typ *t)
  1407. /*  generiert Speicher fuer size Bytes mit Null initialisiert.  */
  1408. /*  Aufpassen, dass kein BSS in einem teilweise initialisierten */
  1409. /*  Array erzeugt wird.                                         */
  1410. /*  t darf 0 sein, dann sind es nur Fuellbytes                  */
  1411. {
  1412.     if(section!=BSS&&newobj){fprintf(f,bssname);section=BSS;}
  1413.     fprintf(f,"\tds.b\t%d\n",size);newobj=0;
  1414. }
  1415. void gen_align(FILE *f,int align)
  1416. /*  generiert alignment auf align Bytes (oder aehnlich)         */
  1417. {
  1418.     if(align>1) fprintf(f,"\tcnop\t0,4\n");
  1419. }
  1420. void gen_var_head(FILE *f,struct Var *v)
  1421. /*  generiert Kopf fuer eine Variable                           */
  1422. {
  1423.     int constflag;
  1424.     if(v->clist){
  1425.         if(!(v->vtyp->flags&(CONST|STRINGCONST))){
  1426.             struct Typ *t=v->vtyp;
  1427.             constflag=0;
  1428.             do{
  1429.                 if(t->flags&(CONST|STRINGCONST)){constflag=1; break;}
  1430.                 if((t->flags&15)!=ARRAY) break;
  1431.                 t=t->next;
  1432.             }while(1);
  1433.         }else constflag=1;
  1434.     }
  1435.     if(v->storage_class==STATIC){
  1436.         if((v->vtyp->flags&15)==FUNKT) return;
  1437.         if(v->clist&&(!constflag||(g_flags[7]&USEDFLAG))&§ion!=DATA){fprintf(f,dataname);section=DATA;}
  1438.         if(v->clist&&constflag&&!(g_flags[7]&USEDFLAG)&§ion!=CODE){fprintf(f,codename);section=CODE;}
  1439.         if(!v->clist&§ion!=BSS){fprintf(f,bssname);section=BSS;}
  1440.         fprintf(f,"\tcnop\t0,4\nl%d\n",v->offset);
  1441.         newobj=1;
  1442.     }
  1443.     if(v->storage_class==EXTERN){
  1444.         fprintf(f,"\tpublic\t_%s\n",v->identifier);
  1445.         if(v->flags&(DEFINED|TENTATIVE)){
  1446.             if(v->clist&&(!constflag||(g_flags[7]&USEDFLAG))&§ion!=DATA){fprintf(f,dataname);section=DATA;}
  1447.             if(v->clist&&constflag&&!(g_flags[7]&USEDFLAG)&§ion!=CODE){fprintf(f,codename);section=CODE;}
  1448.             if(!v->clist&§ion!=BSS){fprintf(f,bssname);section=BSS;}
  1449.             fprintf(f,"\tcnop\t0,4\n_%s\n",v->identifier);
  1450.             newobj=1;
  1451.         }
  1452.     }
  1453. }
  1454. void gen_dc(FILE *f,int t,struct const_list *p)
  1455. /*  generiert Konstanten fuer Typ t aus clist p                 */
  1456. {
  1457.     char s;
  1458.     if(!p){ierror(0);return;}
  1459. /*    if(section!=DATA){fprintf(f,dataname);section=DATA;}*/
  1460.     if((t&15)==FLOAT||(t&15)==DOUBLE) s='l'; else s=x_t[t&15];
  1461.     fprintf(f,"\tdc.%c\t",s);
  1462.     if(!p->tree){
  1463.         if((t&15)==FLOAT||(t&15)==DOUBLE){
  1464.         /*  auch wieder nicht sehr schoen und IEEE noetig   */
  1465.             int *ip;
  1466.             ip=(int *)&p->val.vdouble;
  1467.             fprintf(f,"$%x",*ip);
  1468.             if((t&15)==DOUBLE) fprintf(f,",$%x",*(++ip));
  1469.         }else{
  1470.             printval(f,&p->val,t&31,0);
  1471.         }
  1472.     }else{
  1473.         p->tree->o.am=0;
  1474.         probj(f,&p->tree->o,t&31,2);
  1475.     }
  1476.     fprintf(f,"\n");newobj=0;
  1477. }
  1478.  
  1479. void move(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg,int t)
  1480. /*  erzeugt eine move Anweisung...Da sollen mal Optimierungen rein  */
  1481. {
  1482.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  1483.     if(!qreg&&(q->flags&(REG|DREFOBJ))==REG) qreg=q->reg;
  1484.     if(zreg==qreg&&zreg) return;
  1485.     if(q&&(q->flags&VARADR)&&zreg>=1&&zreg<=8){
  1486.         fprintf(f,"\tlea\t");
  1487.         q->flags&=~VARADR;probj(f,q,t,0);q->flags|=VARADR;
  1488.         fprintf(f,",%s\n",regnames[zreg]);
  1489.         return;
  1490.     }
  1491.     if(zreg>=9&&zreg<=16&&q&&(q->flags&KONST)&&isquickkonst(&q->val,t)){
  1492.         fprintf(f,"\tmoveq\t");
  1493.     }else{
  1494.         if(zreg>=17||qreg>=17){
  1495.             if(qreg>=17&&zreg>=17) fprintf(f,"\tfmove.x\t");
  1496.              else fprintf(f,"\tfmove.%c\t",x_t[t&15]);
  1497.         }else{
  1498.             fprintf(f,"\tmove.%c\t",x_s[sizetab[t&15]]);
  1499.         }
  1500.     }
  1501.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj(f,q,t,0);
  1502.     fprintf(f,",");
  1503.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj(f,z,t,0);
  1504.     fprintf(f,"\n");
  1505. }
  1506. void add(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg,int t)
  1507. /*  erzeugt eine add Anweisung...Da sollen mal Optimierungen rein   */
  1508. {
  1509.     if(!qreg&&!q) ierror(0);
  1510.     if(!zreg&&!z) ierror(0);
  1511.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  1512.     if(!qreg&&(q->flags&KONST)&&isquickkonst2(&q->val,t)){
  1513.         fprintf(f,"\taddq.%c\t",x_t[t&15]);
  1514.     }else{
  1515.         /*  hier noch Abfrage, ob #c.w,ax   */
  1516.         fprintf(f,"\tadd.%c\t",x_t[t&15]);
  1517.     }
  1518.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj(f,q,t,0);
  1519.     fprintf(f,",");
  1520.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj(f,z,t,0);
  1521.     fprintf(f,"\n");
  1522. }
  1523. void sub(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg,int t)
  1524. /*  erzeugt eine sub Anweisung...Da sollen mal Optimierungen rein   */
  1525. {
  1526.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  1527.     if(q&&(q->flags&KONST)&&isquickkonst2(&q->val,t)){
  1528.         fprintf(f,"\tsubq.%c\t",x_t[t&15]);
  1529.     }else{
  1530.         /*  hier noch Abfrage, ob #c.w,ax   */
  1531.         fprintf(f,"\tsub.%c\t",x_t[t&15]);
  1532.     }
  1533.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj(f,q,t,0);
  1534.     fprintf(f,",");
  1535.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj(f,z,t,0);
  1536.     fprintf(f,"\n");
  1537. }
  1538. void mult(FILE *f,struct obj *q,int qreg,struct obj *z,int zreg, int t,int c,struct IC *p)
  1539. /*  erzeugt eine mult Anweisung...Da sollen mal Optimierungen rein  */
  1540. /*  erzeugt auch div/mod etc.                                       */
  1541. {
  1542.     int modreg;
  1543.     if(!qreg&&(q->flags&(REG|DREFOBJ))==REG) qreg=q->reg;
  1544.     if(!zreg&&(z->flags&(REG|DREFOBJ))==REG) zreg=z->reg;
  1545.     if((c==MULT||c==DIV||c==MOD)&&g_flags_val[0].l<68020&&sizetab[t&15]==4){
  1546.         if(c==MULT){
  1547.         /*  ist das mit get_reg(.,.,0) ok? nochmal ueberdenken...   */
  1548.         /*  ...die ganze Routine am besten...                       */
  1549.         /*  ...es war nicht, deshalb ist es jetzt geaendert         */
  1550.             int dx,dy,t1,t2;
  1551.             if(zreg>=9&&zreg<=16){
  1552.                 dx=zreg;
  1553.             }else{
  1554.                 dx=get_reg(f,1,p);
  1555.                 move(f,z,0,0,dx,t);
  1556.             }
  1557.             if(qreg>=9&&qreg<=16&&qreg!=dx){
  1558.                 dy=qreg;
  1559.             }else{
  1560.                 dy=get_reg(f,1,p);
  1561.                 move(f,q,0,0,dy,t);
  1562.             }
  1563.             t1=get_reg(f,1,p);t2=get_reg(f,1,p);
  1564.             if(t1==dx||t2==dx||t1==dy||t2==dy) ierror(0);
  1565.             fprintf(f,"\tmove.l\t%s,%s\n",regnames[dx],regnames[t1]);
  1566.             fprintf(f,"\tmove.l\t%s,%s\n",regnames[dy],regnames[t2]);
  1567.             fprintf(f,"\tswap\t%s\n",regnames[t1]);
  1568.             fprintf(f,"\tswap\t%s\n",regnames[t2]);
  1569.             fprintf(f,"\tmulu.w\t%s,%s\n",regnames[dy],regnames[t1]);
  1570.             fprintf(f,"\tmulu.w\t%s,%s\n",regnames[dx],regnames[t2]);
  1571.             fprintf(f,"\tmulu.w\t%s,%s\n",regnames[dy],regnames[dx]);
  1572.             fprintf(f,"\tadd.w\t%s,%s\n",regnames[t2],regnames[t1]);
  1573.             fprintf(f,"\tswap\t%s\n",regnames[t1]);
  1574.             fprintf(f,"\tclr.w\t%s\n",regnames[t1]);
  1575.             fprintf(f,"\tadd.l\t%s,%s\n",regnames[t1],regnames[dx]);
  1576.             if(zreg!=dx) move(f,0,t1,z,0,t);
  1577.         }else ierror(0);
  1578.         return;
  1579.     }
  1580.     if(c==MULT){
  1581.         /*  das duerfte nur der Aesthetik dienen... */
  1582.         if(t&UNSIGNED) fprintf(f,"\tmulu.%c\t",x_t[t&15]); else fprintf(f,"\tmuls.%c\t",x_t[t&15]);
  1583.     }
  1584.     if(c==DIV){
  1585.         if(t&UNSIGNED) fprintf(f,"\tdivu.%c\t",x_t[t&15]); else fprintf(f,"\tdivs.%c\t",x_t[t&15]);
  1586.     }
  1587.     if(qreg) fprintf(f,"%s",regnames[qreg]); else probj(f,q,t,0);
  1588.     fprintf(f,",");
  1589.     /*  eigentlich muss zreg!=0 sein...     */
  1590.     if(zreg) fprintf(f,"%s",regnames[zreg]); else probj(f,z,t,0);
  1591.     fprintf(f,"\n");
  1592. }
  1593.  
  1594. struct IC *am_freedreg[9],*am_shiftdreg[9];
  1595. struct IC *am_dist_ic[9],*am_dreg_ic[9],*am_use[9];
  1596. /*  am_dist_ic und am_dreg_ic werden auch fuer (ax)+ benutzt    */
  1597. long am_dist[9],am_dreg[9],am_base[9],am_inc[9],am_skal[9],am_dbase[9];
  1598. #define AMS sizeof(struct AddressingMode)
  1599.  
  1600. void clear_am(int reg)
  1601. /*  loescht Werte fuer erweiterte Adressierungsarten fuer Register reg  */
  1602. {
  1603.     if(reg<0||reg>16) ierror(0);
  1604.     if(DEBUG&32) printf("clear_am(%s)\n",regnames[reg]);
  1605.     if(reg<=8){
  1606.         am_dist_ic[reg]=am_dreg_ic[reg]=am_use[reg]=0;
  1607.         am_dist[reg]=am_dreg[reg]=am_base[reg]=am_inc[reg]=0;
  1608.     }else{
  1609.         reg-=8;
  1610.         am_freedreg[reg]=am_shiftdreg[reg]=0;
  1611.         am_skal[reg]=am_dbase[reg]=0;
  1612.     }
  1613. }
  1614. int addressing(void)
  1615. /*  Untersucht ICs auf erweiterte Addresierungsarten    */
  1616. {
  1617.     struct IC *p;int count,localused=0;
  1618.     if(DEBUG&32) printf("addressing() started\n");
  1619.     for(count=1;count<=16;count++) clear_am(count);
  1620.     for(count=0,p=first_ic;p;p=p->next){
  1621.         int c=p->code,q1reg,q2reg,zreg;
  1622.         if(p->q1.flags®) q1reg=p->q1.reg; else q1reg=0;
  1623.         if(p->q2.flags®) q2reg=p->q2.reg; else q2reg=0;
  1624.         if(p->z.flags®) zreg=p->z.reg; else zreg=0;
  1625.         if(c==ADDI2P) c=ADD;
  1626.         if(c==SUBIFP) c=SUB;
  1627.         if(DEBUG&32) pric2(stdout,p);
  1628.         if(!localused){
  1629.             if((p->q1.flags&(VAR|REG))==VAR&&(p->q1.v->storage_class==AUTO||p->q1.v->storage_class==REGISTER)&&p->q1.v->offset>=0)
  1630.                 localused=1;
  1631.             if((p->q2.flags&(VAR|REG))==VAR&&(p->q2.v->storage_class==AUTO||p->q2.v->storage_class==REGISTER)&&p->q2.v->offset>=0)
  1632.                 localused=1;
  1633.             if((p->z.flags&(VAR|REG))==VAR&&(p->z.v->storage_class==AUTO||p->z.v->storage_class==REGISTER)&&p->z.v->offset>=0)
  1634.                 localused=1;
  1635.             if(DEBUG&32&&localused==1) printf("localused=1\n");
  1636.         }
  1637.         if(c==ASSIGN&&isreg(q1)&&isreg(z)&&q1reg>=1&&q1reg<=8&&zreg>=1&&zreg<=8){
  1638.         /*  fuer (ax)+  */
  1639.             int i;
  1640.             for(i=1;i<=8;i++)
  1641.                 if(am_base[i]==zreg||am_base[i]==q1reg) clear_am(i);
  1642.             clear_am(zreg);am_base[zreg]=q1reg;am_dreg_ic[zreg]=p;
  1643.             if(DEBUG&32) printf("move %s,%s found\n",regnames[q1reg],regnames[zreg]);
  1644.             continue;
  1645.         }
  1646.         if(c==MULT&&g_flags_val[0].l>=68020&&(p->q2.flags&KONST)&&isreg(z)&&zreg>=9&&zreg<=16){
  1647.         /*  dx=a*const, fuer Skalierung    */
  1648.             int dreg=zreg-8;
  1649.             if(dreg<1||dreg>8) ierror(0);
  1650.             if(DEBUG&32) printf("mult x,const->dreg found\n");
  1651.             if(am_skal[dreg]) {clear_am(zreg);continue;}
  1652.             eval_const(&p->q2.val,p->typf);
  1653.             am_skal[dreg]=zl2l(vlong);
  1654.             if(am_skal[dreg]!=2&&am_skal[dreg]!=4&&am_skal[dreg]!=8)
  1655.                 {clear_am(zreg);continue;}
  1656.             am_shiftdreg[dreg]=p;
  1657.             if(isreg(q1)&&q1reg>=9&&q1reg<=16) am_dbase[dreg]=q1reg; else am_dbase[dreg]=zreg;
  1658.             if(DEBUG&32) printf("is usable\n");
  1659.             continue;
  1660.         }
  1661.         if((c==ADD||c==SUB)&&(p->q2.flags&KONST)&&zreg>=1&&zreg<=8&&isreg(z)){
  1662.         /*  add ax,#const,ax->az Test auf d8/16 fehlt noch (nicht mehr) */
  1663.             long l;
  1664.             if(zreg<1||zreg>8) ierror(0);
  1665.             if(am_dist[zreg]||am_inc[zreg]) {clear_am(zreg);continue;} /* nur ein Offset */
  1666.             eval_const(&p->q2.val,p->typf);
  1667.             l=zl2l(vlong);
  1668.             if(c==SUB) l=-l;
  1669.             if(isreg(q1)&&q1reg==zreg&&(l==1||l==2||l==4)){
  1670.             /*  ax+=const, fuer (ax)+   */
  1671.                 int i,f;
  1672.                 for(f=0,i=1;i<=8;i++){
  1673.                     if(am_base[i]==zreg&&!am_dreg[i]&&!am_dist[i]){
  1674.                         if(f) ierror(0);
  1675.                         am_inc[i]=l;am_dist_ic[i]=p;f=i;
  1676.                         if(DEBUG&32) printf("inc %s found\n",regnames[i]);
  1677.                     }
  1678.                 }
  1679.                 if(f) continue;
  1680.             }
  1681.             am_dist[zreg]=l;
  1682.             if(DEBUG&32) printf("dist=%ld\n",am_dist[zreg]);
  1683.             if(g_flags_val[0].l<68020){
  1684.             /*  bei <68020 darf der Offset nur 16bit oder 8bit bei dreg sein */
  1685.                 if((am_dreg[zreg]&&(am_dist[zreg]<-128||am_dist[zreg]>127))||am_dist[zreg]<-32768||am_dist[zreg]>32767)
  1686.                     {clear_am(zreg);continue;}
  1687.             }
  1688.             am_dist_ic[zreg]=p;
  1689.             if(am_base[zreg]){
  1690.                 if(q1reg!=zreg||!isreg(q1)) {clear_am(zreg);continue;}
  1691.             }else{
  1692.                 if(q1reg>=1&&q1reg<=8&&isreg(q1)) am_base[zreg]=q1reg; else am_base[zreg]=zreg;
  1693.                 if(DEBUG&32) printf("%s potential base for %s\n",regnames[am_base[zreg]],regnames[zreg]);
  1694.             }
  1695.             if(DEBUG&32) printf("add #const,%s found\n",regnames[zreg]);
  1696.             continue;
  1697.         }
  1698.         if(c==ADD&&q2reg>=9&&q2reg<=16&&isreg(q2)&&zreg>=1&&zreg<=8&&isreg(z)&&(p->q1.flags&(REG|DREFOBJ))!=(REG|DREFOBJ)){
  1699.         /*  add ax,dy->az   */
  1700.             int i;
  1701.             if(zreg<1||zreg>8) ierror(0);
  1702.             for(i=1;i<=8;i++)
  1703.                 if(am_dreg[i]==q2reg){ clear_am(q2reg);clear_am(i);}
  1704.             if(am_dreg[zreg]||am_inc[zreg]) {clear_am(zreg);continue;} /* nur ein Regoffset */
  1705.             if(g_flags_val[0].l<68020&&(am_dist[zreg]<-128||am_dist[zreg]>127))
  1706.                 {clear_am(zreg);continue;} /* bei <68020 nur 8bit Offset */
  1707.             am_dreg[zreg]=q2reg;
  1708.             if((p->typf&15)==SHORT) am_dreg[zreg]|=128; /* dx.w statt dx.l */
  1709.             am_dreg_ic[zreg]=p;
  1710.             if(am_base[zreg]){
  1711.                 if(q1reg!=zreg||!isreg(q1)) {clear_am(zreg);continue;}
  1712.             }else{
  1713.                 if(q1reg>=1&&q1reg<=8&&isreg(q1)) am_base[zreg]=q1reg; else am_base[zreg]=zreg;
  1714.             }
  1715.             if(DEBUG&32) printf("add %s,%s found\n",regnames[q2reg],regnames[zreg]);
  1716.             continue;
  1717.         }
  1718.         if(c==FREEREG){
  1719.         /*  wir koennen den Modus tatsaechlich benutzen */
  1720.             struct AddressingMode *am;struct IC *p1,*p2;int dreg;
  1721.             if(DEBUG&32) printf("freereg found, code=%d\n",p->code);
  1722.             if(q1reg>=9&&q1reg<=16) {am_freedreg[q1reg-8]=p;if(DEBUG&32) printf("freedreg[%d]=%lx\n",q1reg-8,(long)p);}
  1723.             if(q1reg>8||!am_use[q1reg]) continue;
  1724.             p1=am_dist_ic[q1reg];p2=am_dreg_ic[q1reg];
  1725.             if(DEBUG&32){
  1726.                 printf("could really use %s\n",regnames[q1reg]);
  1727.                 if(p1) pric2(stdout,p1);
  1728.                 if(p2) pric2(stdout,p2);
  1729.             }
  1730.             if(am_base[q1reg]==q1reg){
  1731.                 if(p1) {p1->q2.flags=0;p1->code=ASSIGN;p1->q2.reg=4;p1->typf=POINTER;}
  1732.                 if(p2) {p2->q2.flags=0;p2->code=ASSIGN;p2->q2.reg=4;p2->typf=POINTER;}
  1733.             }else{
  1734.                 if(p1) remove_IC(p1);
  1735.                 if(p2) remove_IC(p2);
  1736.             }
  1737.             dreg=(am_dreg[q1reg]&127)-8;
  1738.             am=(struct AddressingMode *)mymalloc(AMS);
  1739.             am->skal=0;
  1740.             am->basereg=am_base[q1reg];
  1741.             am->dist=am_dist[q1reg];
  1742.             am->dreg=am_dreg[q1reg];
  1743.             if(am_inc[q1reg]) am->skal=-1;
  1744.             if(dreg>0){
  1745.                 /*  bei (d,ax,dy) das freereg dy nach hinten verschieben    */
  1746.                 if(dreg<1||dreg>8) ierror(0);
  1747.                 if(p1=am_freedreg[dreg]){
  1748.                     if(DEBUG&32){
  1749.                         printf("freereg %s moved from %p to %p\n",regnames[dreg+8],p1,p);
  1750.                         pric2(stdout,p1);
  1751.                     }
  1752.                     if(p1->code!=FREEREG){ierror(0);printf("freereg[%d]=%p\n",dreg,p1);continue;}
  1753.                     if(!p1->next) {ierror(0);continue;}
  1754.                     if(!p1->prev) {ierror(0);continue;}
  1755.                     p1->prev->next=p1->next;
  1756.                     p1->next->prev=p1->prev;
  1757.                     p1->next=p->next;
  1758.                     p1->prev=p;
  1759.                     if(p->next) p->next->prev=p1;
  1760.                     p->next=p1;
  1761.                 }
  1762.                 if(am_skal[dreg]){
  1763.                 /*  Skalierung bearbeiten   */
  1764.                     if(p1){
  1765.                         am->skal=am_skal[dreg];
  1766.                         am->dreg=am_dbase[dreg];
  1767.                         p1=am_shiftdreg[dreg];
  1768.                         if(DEBUG&32) pric2(stdout,p1);
  1769.                         if(am_dbase[dreg]==dreg+8){
  1770.                             p1->code=ASSIGN;p1->q2.flags=0;p1->q2.reg=sizetab[p1->typf&15];
  1771.                         }else remove_IC(p1);
  1772.                     }
  1773.                     clear_am(dreg+8);
  1774.                 }
  1775.             }
  1776.             /*  das hier duerfte unnoetig sein, da die Adressierungsart in  */
  1777.             /*  einem IC eigentlich hoechstens einmal vorkommen darf        */
  1778.             if(q1reg<0||q1reg>8) ierror(0);
  1779.             p1=am_use[q1reg];
  1780.             if(DEBUG&32) pric2(stdout,p1);
  1781.             if(p1->code==PUSH&&p1->q1.reg==q1reg&&((p1->q1.flags&(DREFOBJ|REG))==(REG))){
  1782.                 p1->q1.am=(struct AddressingMode *)mymalloc(AMS);
  1783.                 memcpy(p1->q1.am,am,AMS);
  1784.                 p1->code=PEA;
  1785.                 if(DEBUG&32) printf("q1 patched\n");
  1786.             }
  1787.             if(p1->q1.reg==q1reg&&((p1->q1.flags&(DREFOBJ|REG))==(DREFOBJ|REG))){
  1788.                 p1->q1.am=(struct AddressingMode *)mymalloc(AMS);
  1789.                 memcpy(p1->q1.am,am,AMS);
  1790.                 if(DEBUG&32) printf("q1 patched\n");
  1791.             }
  1792.             if(p1->q2.reg==q1reg&&((p1->q2.flags&(DREFOBJ|REG))==(DREFOBJ|REG))){
  1793.                 p1->q2.am=(struct AddressingMode *)mymalloc(AMS);
  1794.                 memcpy(p1->q2.am,am,AMS);
  1795.                 if(DEBUG&32) printf("q2 patched\n");
  1796.             }
  1797.             if(p1->z.reg==q1reg&&((p1->z.flags&(DREFOBJ|REG))==(DREFOBJ|REG))){
  1798.                 p1->z.am=(struct AddressingMode *)mymalloc(AMS);
  1799.                 memcpy(p1->z.am,am,AMS);
  1800.                 if(DEBUG&32) printf("z patched\n");
  1801.             }
  1802.             free(am);count++;
  1803.             clear_am(q1reg);
  1804.             continue;
  1805.         }
  1806.         if(c==LABEL){
  1807.             int i;      /*  ueber Labels hinweg ist das zu unsicher */
  1808.             for(i=1;i<=16;i++) clear_am(i);
  1809.             continue;
  1810.         }
  1811.         /*  Wenn Libraryaufrufe noetig sind (floating point ohne FPU oder   */
  1812.         /*  32bit mul/div/mod ohne 020+) keine Addressierungsarten nutzen   */
  1813.         if(g_flags_val[1].l<68000&&(p->typf==FLOAT||p->typf==DOUBLE||c==CONVFLOAT||c==CONVDOUBLE)){
  1814.             int i;
  1815.             for(i=1;i<=16;i++) clear_am(i);
  1816.             continue;
  1817.         }
  1818.         if(g_flags_val[0].l<68020&&(c==DIV||c==MOD)){
  1819.             int i;
  1820.             for(i=1;i<=16;i++) clear_am(i);
  1821.             continue;
  1822.         }
  1823.         if(c==PUSH&&((p->q1.flags&(DREFOBJ|REG))==REG&&q1reg<=8&&(am_inc[q1reg]||am_dist[q1reg]||am_dreg[q1reg]))){
  1824.             if(q1reg<1||q1reg>8) ierror(0);
  1825.             if(am_inc[q1reg]&&am_inc[q1reg]!=sizetab[p->typf&15]) clear_am(q1reg);
  1826.             if(DEBUG&32) printf("use of %s found\n",regnames[q1reg]);
  1827.         }
  1828.         if(((p->q1.flags&(DREFOBJ|REG))==(DREFOBJ|REG)&&q1reg<=8&&(am_inc[q1reg]||am_dist[q1reg]||am_dreg[q1reg]))){
  1829.             if(q1reg<1||q1reg>8) ierror(0);
  1830.             if(am_use[q1reg]&&(am_use[q1reg]!=p||am_inc[q1reg])) clear_am(q1reg); else am_use[q1reg]=p;
  1831.             if(am_inc[q1reg]&&am_inc[q1reg]!=sizetab[p->typf&15]) clear_am(q1reg);
  1832.             if(DEBUG&32) printf("use of %s found\n",regnames[q1reg]);
  1833.         }
  1834.         if(((p->q2.flags&(DREFOBJ|REG))==(DREFOBJ|REG)&&q2reg<=8&&(am_inc[q2reg]||am_dist[q2reg]||am_dreg[q2reg]))){
  1835.             if(q2reg<1||q2reg>8) ierror(0);
  1836.             if(am_use[q2reg]&&(am_use[q2reg]!=p||am_inc[q2reg])) clear_am(q2reg); else am_use[q2reg]=p;
  1837.             if(am_inc[q2reg]&&am_inc[q2reg]!=sizetab[p->typf&15]) clear_am(q2reg);
  1838.             if(DEBUG&32) printf("use of %s found\n",regnames[q2reg]);
  1839.         }
  1840.         if(((p->z.flags&(DREFOBJ|REG))==(DREFOBJ|REG)&&zreg<=8&&(am_inc[zreg]||am_dist[zreg]||am_dreg[zreg]))){
  1841.             if(zreg<1||zreg>8) ierror(0);
  1842.             if(am_use[zreg]&&(am_use[zreg]!=p||am_inc[zreg])) clear_am(zreg); else am_use[zreg]=p;
  1843.             if(am_inc[zreg]&&am_inc[zreg]!=sizetab[p->typf&15]) clear_am(zreg);
  1844.             if(DEBUG&32) printf("use of %s found\n",regnames[zreg]);
  1845.         }
  1846.         if(c==ALLOCREG){
  1847.         /*  allocreg zaehlt als zerstoerung von reg */
  1848.             p->z.flags=REG;
  1849.             p->z.reg=zreg=q1reg;
  1850.         }
  1851.         if(q1reg>=1&&q1reg<=16&&isreg(q1)&&(q1reg>8||am_use[q1reg]!=p)) clear_am(q1reg);
  1852.         if(q2reg>=1&&q2reg<=16&&isreg(q2)&&(q2reg>8||am_use[q2reg]!=p)) clear_am(q2reg);
  1853.         if(zreg>=1&&zreg<=16&&isreg(z)) clear_am(zreg);
  1854.         if(isreg(z)&&zreg<=16){
  1855.         /*  schauen, ob eines der Register ueberschrieben wird  */
  1856.         /*  wohl noch sehr langsam                              */
  1857.             int i;
  1858.             for(i=1;i<=8;i++)
  1859.                 if(!am_use[i]&&(am_base[i]==zreg||(am_dreg[i]&127)==zreg)) clear_am(i);
  1860.         }
  1861.         if(c==ALLOCREG) p->z.flags=0;
  1862.     }
  1863.     if(DEBUG&1) printf("%d addressingmodes used, localused=%d\n",count,localused);
  1864.     return(localused);
  1865. }
  1866. int alignment(struct obj *o)
  1867. /*  versucht rauszufinden, wie ein Objekt alignet ist   */
  1868. {
  1869.     /*  wenn es keine Variable ist, kann man nichts aussagen    */
  1870.     long os;
  1871.     if((o->flags&(DREFOBJ|VAR))!=VAR||o->am) return(0);
  1872.     if(!o->v) ierror(0);
  1873.     os=zl2l(o->val.vlong);
  1874.     if(o->v->storage_class==AUTO||o->v->storage_class==REGISTER){
  1875.         if(!(g_flags[8]&USEDFLAG)){
  1876.             if(o->v->offset<0) os=os+loff-o->v->offset;
  1877.              else              os=os+o->v->offset;
  1878.         }else{
  1879.             if(o->v->offset<0) os=os-o->v->offset+4;
  1880.              else              os=os-(o->v->offset+szof(o->v->vtyp));
  1881.         }
  1882.     }
  1883.     return(os&3);
  1884. }
  1885. void assign(FILE *f,struct IC *p,struct obj *q,struct obj *z,int c,int size,int t)
  1886. /*  Generiert Code fuer Zuweisungen und PUSH/POP; hier noch einiges zu tun  */
  1887. {
  1888.     /*  auch noch sehr fpu-spezifisch   */
  1889.     if(t==FLOAT||t==DOUBLE){
  1890.         if(q&&(q->flags&KONST)){
  1891.             if(z&&(z->flags&(DREFOBJ|REG))==REG){
  1892.             /*  FP-Konstante->Register (muss immer reinpassen)  */
  1893.                 if(z->reg>=17) fprintf(f,"\tfmove"); else fprintf(f,"\tmove");
  1894.                 fprintf(f,".%c\t",x_t[t&15]);probj(f,q,t,0);
  1895.                 fprintf(f,",%s\n",regnames[z->reg]);
  1896.             }else{
  1897.             /*  FP-Konstante->Speicher (evtl. auf zweimal)  */
  1898.                 int m,*ip=(int *)&q->val.vfloat; /* nicht sehr schoen  */
  1899.                 if(c==PUSH&&t==DOUBLE) {fprintf(f,"\tmove.l\t#$%x,-(a7)\n",ip[1]);stackoffset-=4;}
  1900.                 fprintf(f,"\tmove.l\t#$%x,",*ip);
  1901.                 if(c==ASSIGN) probj(f,z,t,0); else {fprintf(f,"-(a7)");stackoffset-=4;}
  1902.                 fprintf(f,"\n");
  1903.                 if(t!=DOUBLE||c==PUSH) return;
  1904.                 ip++;m=0;
  1905.                 if(z&&z->flags®){
  1906.                     m=1;z->flags|=D16OFF;
  1907.                     z->val.vlong=l2zl(0L);
  1908.                 }
  1909.                 vlong=l2zl(4L);
  1910.                 z->val.vlong=zladd(z->val.vlong,vlong);
  1911.                 fprintf(f,"\tmove.l\t#$%x,",*ip);probj(f,z,t,0);
  1912.                 fprintf(f,"\n");
  1913.                 if(m){
  1914.                     z->flags&=~D16OFF;vlong=l2zl(4L);
  1915.                     z->val.vlong=zlsub(z->val.vlong,vlong);
  1916.                 }
  1917.             }
  1918.             return;
  1919.         }
  1920.         if((q&&(q->flags®)&&q->reg>=17)||(z&&(z->flags®)&&z->reg>=17)){
  1921.             if(c==ASSIGN&&q->reg==z->reg) return;
  1922.             fprintf(f,"\tfmove.%c\t",x_t[t&15]);
  1923.             if(c==POP) {fprintf(f,"(a7)+");stackoffset+=size;} else probj(f,q,t,0);
  1924.             fprintf(f,",");
  1925.             if(c==PUSH) {fprintf(f,"-(a7)");stackoffset-=size;} else probj(f,z,t,0);
  1926.             fprintf(f,"\n");return;
  1927.         }
  1928.     }
  1929.     if(size<=4&&(t&15)!=ARRAY&&((t&15)!=CHAR||size==1)){
  1930.         if((t&15)==STRUCT||(t&15)==UNION){
  1931.             if(size==2) t=SHORT; else t=LONG;
  1932.         }
  1933.         if(c==ASSIGN){move(f,q,0,z,0,t);return;}
  1934.         /*  Sonderfall pea  */
  1935.         if((q->flags&VARADR)&&c==PUSH){
  1936.             fprintf(f,"\tpea\t");
  1937.             q->flags&=~VARADR; probj(f,q,t,0); q->flags|=VARADR;
  1938.             fprintf(f,"\n"); stackoffset-=4;return;
  1939.         }
  1940.         fprintf(f,"\tmove.%c\t",x_s[size]);
  1941.         if(c==POP) {fprintf(f,"(a7)+");stackoffset+=size;} else probj(f,q,t,0);
  1942.         fprintf(f,",");
  1943.         if(c==PUSH) {fprintf(f,"-(a7)");stackoffset-=size;} else probj(f,z,t,0);
  1944.         fprintf(f,"\n");return;
  1945.     }else{
  1946.         int a1,a2,qreg,zreg,dreg,s=size,loops;char *cpstr;
  1947.         if(c==PUSH) cpstr="\tmove.%c\t-(%s),-(%s)\n"; else cpstr="\tmove.%c\t(%s)+,(%s)+\n";
  1948.         if(c==POP){
  1949.             qreg=8;
  1950.         }else{
  1951.             if(q->flags==(SCRATCH|REG|DREFOBJ)&&q->reg>=1&&q->reg<=8&&!q->am){
  1952.                 qreg=q->reg;
  1953.             }else{
  1954.                 if(c!=ASSIGN&&!regavailable(0)) qreg=pget_reg(f,0,p);
  1955.                     else qreg=get_reg(f,0,p);
  1956.                 fprintf(f,"\tlea\t");probj(f,q,POINTER,0);
  1957.                 fprintf(f,",%s\n",regnames[qreg]);
  1958.             }
  1959.         }
  1960.         if(c==PUSH){
  1961.             zreg=8;
  1962.             fprintf(f,"\tadd%s.%s\t#%d,%s\n",quick[s<=8],strshort[s<=32767],s,regnames[qreg]);
  1963.         }else{
  1964.             zreg=get_reg(f,0,p);
  1965.             fprintf(f,"\tlea\t");probj(f,z,POINTER,0);
  1966.             fprintf(f,",%s\n",regnames[zreg]);
  1967.         }
  1968.         if(c!=POP) a1=alignment(q); else a1=0;
  1969.         if(c!=PUSH)  a2=alignment(z); else a2=0;
  1970.         /*  wenn Typ==CHAR, dann ist das ein inline_memcpy und wir nehmen   */
  1971.         /*  das unguenstigste Alignment an                                  */
  1972.         if((t&15)==CHAR){ a1=1;a2=2;}
  1973.  
  1974.         if((a1&1)&&(a2&1)){fprintf(f,cpstr,'b',regnames[qreg],regnames[zreg]);s--;a1&=~1;a2&=~1;}
  1975.         if((a1&2)&&(a2&2)){fprintf(f,cpstr,'w',regnames[qreg],regnames[zreg]);s-=2;a1&=~2;a2&=~2;}
  1976.         if(!(a1&1)&&!(a2&1)) loops=s/16-1; else loops=s/4-1;
  1977.         if(loops>0){
  1978.             if(c!=ASSIGN&&!regavailable(1)) dreg=pget_reg(f,0,p);
  1979.                 else dreg=get_reg(f,1,p);
  1980.             fprintf(f,"\tmove%s.l\t#%d,%s\nl%d\n",quick[loops>=-128&&loops<=127],loops,regnames[dreg],++label);
  1981.         }
  1982.         if(loops>=0){
  1983.             int t;
  1984.             if(!(a1&1)&&!(a2&1)) t='l'; else t='b';
  1985.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1986.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1987.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1988.             fprintf(f,cpstr,t,regnames[qreg],regnames[zreg]);
  1989.         }
  1990.         if(loops>0){
  1991.             if(loops<=32767&&loops>=-32768){
  1992.                 fprintf(f,"\tdbra\t%s,l%d\n",regnames[dreg],label);
  1993.             }else{
  1994.                 fprintf(f,"\tsubq.l\t#1,%s\n\tbge\tl%d\n",regnames[dreg],label);
  1995.             }
  1996.         }
  1997.         if(!(a1&1)&&!(a2&1)){
  1998.             if(s&8){
  1999.                 fprintf(f,cpstr,'l',regnames[qreg],regnames[zreg]);
  2000.                 fprintf(f,cpstr,'l',regnames[qreg],regnames[zreg]);
  2001.             }
  2002.             if(s&4) fprintf(f,cpstr,'l',regnames[qreg],regnames[zreg]);
  2003.             if(s&2) fprintf(f,cpstr,'w',regnames[qreg],regnames[zreg]);
  2004.             if(s&1) fprintf(f,cpstr,'b',regnames[qreg],regnames[zreg]);
  2005.         }else{
  2006.             s&=3;
  2007.             while(s){fprintf(f,cpstr,'b',regnames[qreg],regnames[zreg]);s--;}
  2008.         }
  2009.         if(c==PUSH) stackoffset-=size;
  2010.         if(c==POP)  stackoffset+=size;
  2011.     }
  2012.     return;
  2013. }
  2014.  
  2015. int must_convert(np p,int t)
  2016. /*  liefert 1, wenn fuer Umwandlung von p->o nach Typ t tatsaechlich    */
  2017. /*  Code erzeugt werden muss, sonst 0                                   */
  2018. {
  2019.     int o=p->ntyp->flags,op=o&15,tp=t&15;
  2020.     /*  Zeiger sind gleich  */
  2021.     if(tp==POINTER&&op==POINTER) return(0);
  2022.     /*  Pointer und int/long auch   */
  2023.     if(tp==POINTER&&(op==INT||op==LONG)) return(0);
  2024.     if(op==POINTER&&(tp==INT||tp==LONG)) return(0);
  2025.     /*  signed und unsigned integers der selben Groesse sind gleich */
  2026.     if((t&UNSIGNED)&&(o&UNSIGNED)&&(sizetab[tp]==sizetab[op])) return(0);
  2027.     /*  int==long   */
  2028.     if((tp==INT&&op==LONG)||(tp==LONG&&op==INT)) return(0);
  2029.     /*  float und double gibt es in fp-Registern nicht  */
  2030.     if((tp==FLOAT||tp==DOUBLE)&&(op==FLOAT||op==DOUBLE)&&(p->o.flags®)&&p->o.reg>=17&&p->o.reg<=24)
  2031.         return(0);
  2032.  
  2033.     return(1);
  2034. }
  2035.  
  2036. int store_saveregs;
  2037.  
  2038. void saveregs(FILE *f,struct IC *p)
  2039. {
  2040.     int dontsave;
  2041.     store_saveregs=0;
  2042.     if((p->z.flags&(REG|DREFOBJ))==REG) dontsave=p->z.reg; else dontsave=0;
  2043.     if(dontsave!= 9&®s[ 9]) {fprintf(f,"\tmove.l\td0,-(a7)\n");stackoffset-=4;store_saveregs|=1;}
  2044.     if(dontsave!=10&®s[10]) {fprintf(f,"\tmove.l\td1,-(a7)\n");stackoffset-=4;store_saveregs|=2;}
  2045.     if(dontsave!= 1&®s[ 1]) {fprintf(f,"\tmove.l\ta0,-(a7)\n");stackoffset-=4;store_saveregs|=4;}
  2046.     if(dontsave!= 2&®s[ 2]) {fprintf(f,"\tmove.l\ta1,-(a7)\n");stackoffset-=4;store_saveregs|=8;}
  2047. }
  2048. void restoreregsa(FILE *f,struct IC *p)
  2049. {
  2050.     if(store_saveregs&8) {fprintf(f,"\tmove.l\t(a7)+,a1\n");stackoffset+=4;}
  2051.     if(store_saveregs&4) {fprintf(f,"\tmove.l\t(a7)+,a0\n");stackoffset+=4;}
  2052. }
  2053. void restoreregsd(FILE *f,struct IC *p)
  2054. {
  2055.     int dontsave;
  2056.     if((p->z.flags&(REG|DREFOBJ))==REG) dontsave=p->z.reg; else dontsave=0;
  2057.     if(dontsave!=10&&(store_saveregs&2)) {fprintf(f,"\tmovem.l\t(a7)+,d1\n");stackoffset+=4;}
  2058.     if(dontsave!=9 &&(store_saveregs&1)) {fprintf(f,"\tmovem.l\t(a7)+,d0\n");stackoffset+=4;}
  2059. }
  2060.  
  2061.